题解 | 约瑟夫环

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

def pop_pos(n, start_pos, step):
    return (start_pos+step-1)%n

num_list = list(range(n))
cur_n = n
cur_k = k
while(cur_n!=1):    
    num_list.pop(pop_pos(cur_n,cur_k,m))
    cur_k=pop_pos(cur_n,cur_k,m)
    cur_n-=1
    # print(num_list)

print(num_list[0])