7-20 who is the last?

该博客探讨了一个圆形游戏中,从第一个人开始每隔M个人离开,最终剩下的人的编号。问题涉及算法和数据结构,需要计算在N个人中,按照特定规则最后留下的个体编号。
摘要由CSDN通过智能技术生成

There are N people, numbered from 1 to N, sitting around in a circle. Counted from the NO.1, the M th people should leave the game. Then, from the next one, the counting loop will go on. After several loops, there will be only on guy left. Writing a program to calculate who is the last people.

输入格式:

Two integers, separated by commas. The first integer represents N individuals (0<N), the second integer represents M (0<M<=N).

输出格式:

N integers, separated by commas. These numbers indicate the order of the person to leave the circle, with their numbers.

输入样例:

在这里给出一组输入。例如:

5,1

输出样例:

在这里给出相应的输出。例如:

2,4,1,5,
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值