13个人“排序”———到3踢出

const int Len = 13;

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];

	for (int i = 0; i < Len; ++i)
	{
		a[i] = i + 1;
	}

	int pos = 1;
	int i;
	for (i = 0; i < Len - 1; ++i)
	{
		pos = find(a, pos, 3);
		a[pos] = 0;
	}

	output(a);
	return 0;
}