T = int(input())

for t in range(1, T+1):
    abcde = [0, 0, 0, 0, 0]
    lst = [2, 3, 5, 7, 11]

    n = int(input())

    for i in range(len(lst)):
        num = lst[i]
        while n % num == 0:
            n //= num
            abcde[i] += 1

    a = abcde[0]
    b = abcde[1]
    c = abcde[2]
    d = abcde[3]
    e = abcde[4]
    print('#{} {} {} {} {} {}'.format(t, a, b, c, d, e))

'알고리즘 문제 풀이 > SWEA' 카테고리의 다른 글

[SWEA 2001 python] 파리 퇴치  (0) 2021.08.13
[SWEA 1209 python] Sum  (0) 2021.08.13
[SWEA 1954 python] 달팽이 숫자  (0) 2021.08.13
[SWEA 1208 python] Flatten  (0) 2021.08.13
[SWEA 5789 python] 현주의 상자 바꾸기  (0) 2021.08.13
T = 10

for t in range(1, T+1):
    dump = int(input())
    h_list = list(map(int, input().split()))

    cnt_list = [0 for _ in range(101)]

    for h in h_list:
        cnt_list[h] += 1

    l = 1
    r = 100

    while True:
        while cnt_list[r] == 0:
            r -= 1

        while cnt_list[l] == 0:
            l += 1

        if dump <= 0:
            break

        cnt_list[r] -= 1
        cnt_list[l] -= 1

        cnt_list[r - 1] += 1
        cnt_list[l + 1] += 1
        dump -= 1

    result = r - l
    print('#{} {}'.format(t, result))
T = int(input())

for t in range(1, T+1):
    n, q = map(int, input().split())
    lst = [0 for _ in range(n)]

    for i in range(q):
        l, r = map(int, input().split())
        for j in range(l - 1, r):
            lst[j] = i + 1

    result = '#{} '.format(t)

    for num in lst:
        result += '{} '.format(num)

    print(result.strip())

'알고리즘 문제 풀이 > SWEA' 카테고리의 다른 글

[SWEA 2001 python] 파리 퇴치  (0) 2021.08.13
[SWEA 1209 python] Sum  (0) 2021.08.13
[SWEA 1954 python] 달팽이 숫자  (0) 2021.08.13
[SWEA 1945 python] 간단한 소인수분해  (0) 2021.08.13
[SWEA 1208 python] Flatten  (0) 2021.08.13

+ Recent posts