11866 요세푸스

https://www.acmicpc.net/problem/11866

11866번: 요세푸스 문제 0

 

 

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

circle = [i for i in range(1, n + 1)]
#print(circle)
permutation = []
select = k-1
while circle:
    permutation.append(circle.pop(select))
    if circle:
        select = ((select-1) + k) % len(circle)
print(f'<{", ".join(map(str,permutation))}>')