#include<stdio.h>
const int Len = 10;
void output(int* p)
{
int i;
for (i = 0; i < Len&&p[i] == 0; ++i);
printf(“剩下的人是:%d\n”, p[i]);
}
int find(int*p, int pos, int num)
{
int count = 0;
while(1)
{
if (p[pos] != 0)
{
count++;
if ( num== count)
break;
}
pos++;
if (pos >= Len)
pos = 0;
}
return pos;
}
int main()
{
int a[Len];// = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
for (int i = 0; i < Len; ++i)
{
a[i] = i + 1;
}
int pos = 0;
for (int i = 0; i < Len - 1; ++i)
{
//从pos开始(含pos)找第3个非零的数的下标,存在pos中;
pos = find(a, pos, 3);
a[pos] = 0;
}
//从a数组中找到非0的数,并输出;
output(a);
return 0;
}
可以改动Len的值,求出任意人数最后留下来人的编号