https://programmers.co.kr/learn/courses/30/lessons/17687

1. 전체 코드

from collections import deque


def solution(n, t, m, p):
    answer = ''
    k = 0
    d = {10: 'A', 11: 'B', 12: 'C',
         13: 'D', 14: 'E', 15: 'F'}
    while True:
        if k == 100000:
            break
        num = k
        q = deque()
        while True:
            add = num % n
            if add >= 10:
                add = d[add]
            q.appendleft(str(add))
            num = num // n
            if num == 0:
                break
        answer += ''.join(list(q))
        k += 1
    result = ''
    idx = p - 1
    for _ in range(t):
        result += answer[idx]
        idx += m
    return result