[백준] 11866번:요세푸스 문제0 (python 파이썬)

www.acmicpc.net/problem/11866

11866번: 요세푸스 문제 0

소스코드

n, k = map(int, input().split())

people = [0]*n
check = k-1
result = "<"

for i in range(n):
    people[i] = str(i+1)

while people:
    if check >= len(people):
        check = check%len(people)
    if len(people) == 1:
        result += people[check]
        del people[check]
    else:
        result += people[check]+", "
        del people[check]
        check = check-1+k
print(result+">")