快乐冲浪与生活

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

#!/usr/bin/env python
# -*- coding: utf-8 -*-
# author: a2htray
# create date: 2023/3/8

"""
PAT 乙级 1023
"""

if __name__ == '__main__':
    digits = []
    for i, digit in enumerate(map(int, input().split(' '))):
        digits += [i] * digit

    digits.sort()

    if digits[0] != 0:
        print(''.join(map(str, digits)))
        exit(0)

    for i, v in enumerate(digits):
        if v != 0:
            digits[0], digits[i] = digits[i], digits[0]
            break
    print(''.join(map(str, digits)))

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17

#!/usr/bin/env python
# -*- coding: utf-8 -*-
# author: a2htray
# create date: 2023/3/7

"""
PAT 乙级 1021
"""

if __name__ == '__main__':
    counts = [0] * 10
    for s in input():
        counts[int(s)] += 1

    for i, count in enumerate(counts):
        if count != 0:
            print('%d:%d' % (i, count))

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

#!/usr/bin/env python
# -*- coding: utf-8 -*-
# author: a2htray
# create date: 2023/3/6

"""
PAT 乙级 1020
"""
from functools import cmp_to_key


class MoonCake:
    def __init__(self, num, total_price):
        self.num = num
        self.total_price = total_price
        self.unit_price = 1.0 * self.total_price / self.num


def cmp(mooncake1, mooncake2):
    return -1 if mooncake1.unit_price > mooncake2.unit_price else 1


if __name__ == '__main__':
    n_class, max_requirement = map(int, input().split(' '))

    mooncakes = []
    for item in zip(map(float, input().split(' ')), map(float, input().split(' '))):
        if item[0] == 0 or item[1] == 0:
            continue
        mooncakes.append(MoonCake(item[0], item[1]))

    mooncakes = sorted(mooncakes, key=cmp_to_key(cmp))

    sale_price = 0.0

    for i in range(n_class):
        if max_requirement >= mooncakes[i].num:
            sale_price += mooncakes[i].total_price
            max_requirement = max_requirement - mooncakes[i].num
        else:
            sale_price += max_requirement * mooncakes[i].unit_price
            max_requirement = 0
            break

    print('%.2f' % sale_price)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

#!/usr/bin/env python
# -*- coding: utf-8 -*-
# author: a2htray
# create date: 2023/3/6

"""
PAT 乙级 1019
"""


def get_sorted_nums(num_str):
    dn = 4 - len(num_str)
    for _ in range(dn):
        num_str = '0' + num_str

    nums = list(map(int, num_str))
    nums.sort()

    return 1 * nums[0] + 10 * nums[1] + 100 * nums[2] + 1000 * nums[3], \
           1 * nums[3] + 10 * nums[2] + 100 * nums[1] + 1000 * nums[0]


num_str = input()
num1, num2 = get_sorted_nums(num_str)

if num1 == num2:
    print(f'{num1:04d} - {num2:04d} = 0000')
    exit(0)

while num1 - num2 != 6174:
    diff = num1 - num2
    print(f'{num1:04d} - {num2:04d} = {diff:04d}')
    num1, num2 = get_sorted_nums(str(diff))

diff = num1 - num2
print(f'{num1:04d} - {num2:04d} = {diff:04d}')

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43

#!/usr/bin/env python
# -*- coding: utf-8 -*-
# author: a2htray
# create date: 2023/3/6

"""
PAT 乙级 1018
"""

if __name__ == '__main__':
    n = int(input())
    first = [0, 0, 0]
    second = [0, 0, 0]
    first_win = 0
    second_win = 0

    alphabet = ['B', 'C', 'J']

    for _ in range(n):
        p1, p2 = input().split()
        if p1 == 'C' and p2 == 'J':
            first[1] += 1
            first_win += 1
        elif p1 == 'C' and p2 == 'B':
            second[0] += 1
            second_win += 1
        elif p1 == 'B' and p2 == 'J':
            second[2] += 1
            second_win += 1
        elif p1 == 'B' and p2 == 'C':
            first[0] += 1
            first_win += 1
        elif p1 == 'J' and p2 == 'B':
            first[2] += 1
            first_win += 1
        elif p1 == 'J' and p2 == 'C':
            second[1] += 1
            second_win += 1

    print(first_win, n - first_win - second_win, second_win)
    print(second_win, n - first_win - second_win, first_win)

    print(alphabet[first.index(max(first))], alphabet[second.index(max(second))])

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

#!/usr/bin/env python
# -*- coding: utf-8 -*-
# author: a2htray
# create date: 2023/3/8

"""
PAT 乙级 1022
"""


if __name__ == '__main__':
    num1, num2, base = map(int, input().split(' '))

    total = num1 + num2
    if total == 0:
        print(0)
        exit(0)

    res = []
    while total >= 1:
        res = [total % base] + res
        total = total // base

    if res[0] == 0:
        res = res[1:]

    print(''.join(map(str, res)))

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34

#!/usr/bin/env python
# -*- coding: utf-8 -*-
# author: a2htray
# create date: 2023/3/3

"""
PAT 乙级 1013
"""
import math


def is_prime(num):
    for i in range(2, int(math.sqrt(num)) + 1):
        if num % i == 0:
            return False
    return True


if __name__ == '__main__':
    nums_str = input().split(' ')
    m, n = int(nums_str[0]), int(nums_str[1])
    prime_nums = [0] * n

    i = 0
    num = 2
    while i != n:
        if is_prime(num):
            prime_nums[i] = num
            i += 1
        num += 1

    output_nums = prime_nums[m - 1:n]
    for i in range(0, len(output_nums), 10):
        print(' '.join([str(v) for v in output_nums[i:i + 10]]))

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13

#!/usr/bin/env python
# -*- coding: utf-8 -*-
# author: a2htray
# create date: 2023/3/3

"""
PAT 乙级 1009
"""

if __name__ == '__main__':
    statement = input().split(' ')
    statement.reverse()
    print(' '.join(statement))

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39

#!/usr/bin/env python
# -*- coding: utf-8 -*-
# author: a2htray
# create date: 2023/3/3

"""
PAT 乙级 1007
"""
import math


def is_prime(n):
    prime = True
    for i in range(3, int(math.sqrt(n)) + 1):
        if n % i == 0:
            prime = False
            break
    return prime


if __name__ == '__main__':
    nums = [n for n in range(3, int(input()) + 1)]
    nums = [n for n in nums if n % 2 != 0]

    nums = list(filter(is_prime, nums))
    if len(nums) <= 1:
        print(0)
        exit(0)

    count = 0
    i = 0
    j = 1
    while j != len(nums):
        if nums[j] - nums[i] == 2:
            count += 1
        i += 1
        j += 1

    print(count)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

#!/usr/bin/env python
# -*- coding: utf-8 -*-
# author: a2htray
# create date: 2023/3/3

"""
PAT 乙级 1006
"""

if __name__ == '__main__':
    chars = [*input()]
    chars.reverse()

    tail = []
    for i in range(1, int(chars[0]) + 1):
        tail.append(str(i))

    bs_list = [[], []]
    for i, char in enumerate(chars[1:]):
        if i == 0:
            bs_list[0] = ['S'] * int(char)
        else:
            bs_list[1] = ['B'] * int(char)

    print(''.join(bs_list[1] + bs_list[0] + tail))