2017-03-11 09:29:34

Time Limit: 1000MS Memory Limit: 65536KB

n个人想玩残酷的死亡游戏，游戏规则如下：
n个人进行编号，分别从1到n，排成一个圈，顺时针从1开始数到m，数到m的人被杀，剩下的人继续游戏，活到最后的一个人是胜利者。

Input

Output

Example Input
5 3

Example Output
4

Hint

Author

```#include
#include
struct node
{
int Data;
struct node *next;
void Build(int n);//顺序建立循环链表
void Search_ans(struct node *h, int m);//循环链表中删除满足题意的元素结点
int main()
{
int n, m;
while(scanf("%d %d", &n, &m) != EOF)
{
if(n == 1)
printf("%d\n", n);
else
{
head = (struct node *)malloc(sizeof(struct node));
Build(n);//顺序建立循环链表
}
}
return 0;
}
void Build(int n)//顺序建立循环链表
{
struct node *p;
for(int i = 2; i < n; i++)
{
p = (struct node *)malloc(sizeof(struct node));
p->Data = i;
p->next = tail->next;
tail->next = p;
tail = p;
}
p = (struct node *)malloc(sizeof(struct node));
p->Data = n;
tail->next = p;
}
void Search_ans(struct node *h, int m)//在循环链表中删除满足题意的元素结点
{
int cnt = 0;
struct node *q, *p;
q = tail->next;
while(p->next != p)
{
cnt++;
if(cnt % m == 0)
{
q->next = p->next;
free(p);
p = q->next;
}
else
{
q = p;
p = p->next;
}
}
printf("%d\n", p->Data);
}

/***************************************************
User name:
Result: Accepted
Take time: 0ms
Take Memory: 108KB
Submit time: 2017-03-10 21:04:59
****************************************************/```

```#include
#include
struct node
{
int Data;
struct node *next;
void Build(int n);//顺序建立循环链表
void Search_ans(struct node *h, int m);//循环链表中删除满足题意的元素结点
int main()
{
int n, m;
while(scanf("%d %d", &n, &m) != EOF)
{
head = (struct node *)malloc(sizeof(struct node));
Build(n);//顺序建立循环链表
}
return 0;
}
void Build(int n)//顺序建立循环链表
{
struct node *p;
for(int i = 2; i < n; i++)
p = (struct node *)malloc(sizeof(struct nod```
```
```
```    {e));
p->Data = i;
p->next = tail->next;
tail->next = p;
tail = p;
}
if(n != 1)
{
p = (struct node *)malloc(sizeof(struct node));
p->Data = n;
tail->next = p;
}
else
{
}
}
void Search_ans(struct node *h, int m)//在循环链表中删除满足题意的元素结点
{
int cnt = 0;
struct node *q, *p;
q = tail->next;
while(p->next != p)
{
cnt++;
if(cnt % m == 0)
{
q->next = p->next;
free(p);
p = q->next;
}
else
{
q = p;
p = p->next;
}
}
printf("%d\n", p->Data);
}
```