백준 11866번: 요세푸스 문제 0

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

11866번: 요세푸스 문제 0

import sys
import copy
from collections import deque
n, m = map(int,sys.stdin.readline().split())
r = deque([])
nr = deque([])
tr = deque([])
result = []
for i in range(n):
    r.append(i+1)
if m==1:
    for i in range(n):
        result.append(i + 1)
else:
    for j in range(n):
 
        for i in range(m-1,len(r),m):
            result.append(r[i])
            r[i]=0
        if len(r)<m:
            if m % len(r) == 0:
                result.append(r[-1])
                r[-1] = 0
            if m%len(r)!=0:
                for i in range(len(r),m%len(r), -1):
                    tr.appendleft(r[i-1])
                    r[i-1]=0
                result.append(r[i-2])
                r[i-2]=0
        if len(r)>m:
            for i in range(len(r),len(r)-len(r)%m,-1):
                tr.appendleft(r[i-1])
                r[i-1]=0
        tr = tr + r
        for li in tr:
            if li not in nr:
                nr.append(li)
        tr = deque([])
        nr.remove(0)
        r = deque([])
        r = copy.deepcopy(nr)
        nr = deque([])
        if len(r)<m:
            if len(r)==1:
                result.append(r[0])
                break
print("<", end = "")
for i in range(len(result)):
    if i==len(result)-1:
        print(result[i], end="")
        break
    print(result[i], end=", ")
print(">")