#include<stdio.h>
#define N 13
typedef struct peo
{
int num;
int flag;
}PEO;
int main(){
PEO x[N];
int i,k=13,count=0;
for(i=0;i<N;i++){
x[i].num=i+1;
x[i].flag=1;
}
printf("出圈成员及顺序:");
i=0;
while(k>1){
if(x[i].flag){//一旦出圈,flag置为0,轮到出圈的人时,count不加1,即他无需报1.2.3
count++;
if(count==3){
printf("%3d",x[i].num);
x[i].flag=0;
count=0;//记到3,就再从1起
k--;//出圈一个就减去一个人,直到剩下一人
}
}
i++;
if(i==13)i%=13;//13人一轮
}
printf("\n最后的成员是:");
for(i=0;i<N;i++){
if(x[i].flag){
printf("%3d",x[i].num);
}
}
}
#include <stdio.h>
#define N 13
struct person
{
int number;
int nextp;
} link[N + 1];
int main(void)
{
int i, count, h;
/* 建立队列 */
for (i = 1; i <= N; i++)
{
if (i == N)
{
link[i].nextp = 1;
}
else
{
link[i].nextp = i + 1;
}
link[i].number = i;
}
count = 0;
h = N;
printf("出圈成员及顺序:");
while (count < N - 1)
{
i = 0;
while (i != 3)
{
h = link[h].nextp;
if (link[h].number)
{
i++;
}
}
printf("%3d", link[h].number);
link[h].number = 0;
count++;
}
printf("\n最后的成员是:");
for (i = 1; i <= N; i++)
{
if (link[i].number)
{
printf("%3d", link[i].number);
}
}
return 0;
}