"""
https://www.lanqiao.cn/problems/1111/learning/?page=1&first_category_id=1&name=%E7%BA%A6%E7%91%9F%E5%A4%AB%E7%8E%AF
"""
import os
import sys
# 请在此输入您的代码
n, k, m = map(int, input().split())
a = list(range(1, n+1))
i = k - 1 # 初始位置
while len(a) > 0:
i = (i + m - 1) % len(a)
print(a.pop(i))
蓝桥杯-约瑟夫环
最新推荐文章于 2024-07-18 19:36:20 发布