有n个人围成一圈，顺序排号，从第一个开始报数（从1-3报数），凡报道3的人退出，问最后留下来的人是原来的几号；

笨办法，用链表写

#include <stdio.h>
#include <stdlib.h>
//不带头结点的单链表，
typedef struct node
{
int data;
struct node *next;


}node;
typedef node* Linklist;


Linklist H;//定义头指针；


void initlink() //初始化函数
{
H = NULL;


printf("初始化成功！\n"); 
}


int insertlink(e)
{
Linklist p = (node*)malloc(sizeof(node));
if (p == NULL)
{
printf("申请空间失败！\n");
return 0;
}
p->data = e;
if (H==NULL)
{
H=p;
p->next = NULL;
}
Linklist q = H;
while(q->next != NULL)
{
q = q->next;
}
q->next=p;
p->next = NULL;
return 0;
}


int main()
{
initlink();
int n;
int i;
printf("请选择n的值\n");
scanf("%d",&n);
int a[n];
for (i = 1; i <= n; ++i)
{
insertlink(i);

}
Linklist p = H;
while(p->next != NULL)
{
p = p->next;
}
p->next = H;//最后将单链表首尾相连，构成了循环链表；
Linklist q = H;
Linklist lq = NULL;
int num = 0;
int x = 0;
while(q != NULL && x != (n))
{
lq = q;
q = q->next;
num++;
if (num == 2)
{
lq->next = q->next;
a[x++] = q->data;
free(q);
q = lq->next;
num = 0;
}
}//功能，报3清除
printf("最后的是%d\n",a[n-1]);
return 0;
}