题解 | 约瑟夫环
约瑟夫环
https://www.nowcoder.com/practice/e417cfe32c74416ca38247f619ddb322
n, k, m = map(int, input().split())
dui = list(range(n))
while n > 1:
k = (k + m - 1) % n
dui.pop(k)
n = n - 1
print(dui[0])
约瑟夫环
https://www.nowcoder.com/practice/e417cfe32c74416ca38247f619ddb322
n, k, m = map(int, input().split())
dui = list(range(n))
while n > 1:
k = (k + m - 1) % n
dui.pop(k)
n = n - 1
print(dui[0])
相关推荐