有N个小孩围成一圈,给他们从1开始依次编号,现指定从第W个开始报数,报到第S个时,该小孩出列,然后从下一个小孩开始报数,仍是报到S个出列,如此重复下去,直到所有的小孩都出列(总人数不足S个时将循环报数),求小孩出列的顺序。
Input
第一行输入小孩的人数N(N<=64)
接下来每行输入一个小孩的名字(人名不超过15个字符)
最后一行输入W,S (W < N),用逗号”,”间隔
Output
按人名输出小孩按顺序出列的顺序,每行输出一个人名
Sample Input
5
Xiaoming
Xiaohua
Xiaowang
Zhangsan
Lisi
2,3
Sample Output
Zhangsan
Xiaohua
Xiaoming
Xiaowang
Lisi
循环链表解题,注意指针的操作要精确一点,WA了很多次(@_@;)
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdlib>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define e 2.718281828459
#define INF 0x7fffffff
#pragma warning(disable:4996)
#define pf printf
#define sf scanf
#define max(a,b) (a)>(b)?(a):(b);
#define min(a,b) (a)<(b)?(a):(b);
#define pi acos(-1.0);
#define eps 1e-9;
/*
循环链表解题
*/
struct Node {
char name[20];
Node* next;
};
int main(void) {
int n;
int w, s;
Node *head=0, *p=0,*pre=NULL;
sf("%d", &n);
for (int i = 0; i < n; i++) {
Node* ptr = new Node;
sf("%s", ptr->name);
if (head == 0)
head = ptr;
else
p->next = ptr;
p = ptr;
}
p->next = head;//循环链表
sf("%d%*c%d", &w, &s);
while(w--)
pre=p,p = p->next;//从第w个开始,p停在w-1上
for (int i = 0; i < n;i++) {
for (int i = 0; i < s-1; i++)
pre=p,p = p->next;
Node* del = p;
pf("%s\n", del->name);
pre->next = p->next;//保持pre是p的上一个的结构
p = p->next;
delete del;
}
return 0;
}