7-28 猴子选大王(20 分)
一群猴子要选新猴王。新猴王的选择方法是:让N只候选猴子围成一圈,从某位置起顺序编号为1~N号。从第1号开始报数,每轮从1报到3,凡报到3的猴子即退出圈子,接着又从紧邻的下一只猴子开始同样的报数。如此不断循环,最后剩下的一只猴子就选为猴王。请问是原来第几号猴子当选猴王?
输入格式:
输入在一行中给一个正整数N(≤1000)。
输出格式:
在一行中输出当选猴王的编号。
输入样例:
11
输出样例:
7
#include <stdio.h>
#include "stdlib.h"
#define ERROR 0
#define OK 1
typedef int Status;
typedef struct LNode{
int num;
struct LNode *next;
}LNode, *LinkList;
//typedef struct LNode *LinkList;
//circular linked list, including Head node
Status InitList(LinkList *L)
{
*L = (LinkList)malloc(sizeof(LNode));
if(!(*L)) return ERROR;
(*L)->num = 0;
(*L)->next = NULL;//circle
return OK;
}
/*Status InitList(LinkList L)
{
L = (LinkList)malloc(sizeof(LNode));
if(!(L)) return ERROR;
(L)->num = 0;
(L)->next = NULL;//circle
return OK;
}*/
void CreatListTail(LinkList L, int n)
{
LinkList p, r;
r = L;
int i;
for(i=1; i<=n; ++i)
{
p = (LNode *)malloc(sizeof(LNode));
p->num = i;
r->next = p;
r = p;
}
r->next = L;
}
Status ListDelete(LinkList prior)
{
LinkList del = prior->next;
prior->next = del->next;
del->next = NULL;
free(del);
}
int main()
{
int n;
scanf("%d", &n);
LinkList L;
InitList(&L);
CreatListTail(L, n);
LinkList prior = L;
LinkList u = L->next;
for(int i = 0; i < n-1; ++i)
{
if(prior->next == L || prior->next->next== L)
{
prior = prior->next;
}
prior = prior->next->next;
if(prior->next == L)
{
prior = prior->next;
}
ListDelete(prior);
}
printf("%d", L->next->num);
return 0;