题解 | 约瑟夫环
约瑟夫环
https://www.nowcoder.com/practice/e417cfe32c74416ca38247f619ddb322
n,k,m = map(int,input().split())
nums = list(range(0,n)) #num[k] 1 num[k+1] 2 num[k+m-1] m
while len(nums)>1:
idx = (k+m-1)%len(nums)
del nums[idx]
k = idx
print(nums[0])
查看27道真题和解析