3157865_ac_1219ms_388k.cc

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>

int next[10001];
int prev[10001];

int main()
{
	int n, m, t, k;
	int i, num, now;

	while(scanf("%d%d%d",&n,&k,&m)==3){
		if(n==0&&k==0&&m==0)
			break;
	for(i = 1; i <= n; i++)
	{
		next[i] = i+1;
		prev[i] = i-1;
	}
	prev[1] = n;
	next[n] = 1;
	next[prev[m]] = next[m];
	prev[next[m]] = prev[m];
	num = n-1;
	now = next[m];
	for(i = 1; i < n-1; i++,num--)
	{
		t = k;
		if(t > num)
			t %= num;
		if(t==0)
			t = num;
		t--;
		while(t > 0)
		{
			now = next[now];
			t--;
		}
		next[prev[now]] = next[now];
		prev[next[now]] = prev[now];
		now = next[now];
	}
	for(i = 1; i <= n; i++)
	{
		if(next[i]==i)
		{
			printf("%d\n",i);
			break;
		}
	}
	}
	return 0;
}