题目:
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,3
代码如下:
#include <stdio.h>
#include <malloc.h>
struct Node
{
int data;
struct Node

文章描述了一个问题,当N个人围坐成一圈,从第M个人开始计数,每经过一轮,第M个人离开,直到只剩一人。要求编写程序确定最后留下的玩家顺序。给出了使用链表实现的代码示例。
最低0.47元/天 解锁文章





