POJ1012 Joseph

//5_4_3:	Joseph k个好人和坏人判断步长问题 POJ1012
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
	int i,k,m,n,s,t,flag,ans[15];
	for(k = 1;k <= 13;k ++)
	{
		i = 1;
		n = 2 * k;
		s = t = flag = 0;
		m = s * (k + 1) + 1;
		while(i <= k)
		{
			t = (t + m - 1) % (n - i + 1);
			i ++;
			if(t < k)
			{
				t = 0;
				i = 1;
				if(flag == 0)
				{
					flag = 1;
					s ++;
					m = s * (k + 1);
				}
				else
				{
					flag = 0;
					m = s * (k + 1) + 1;
				}
			}
		}
		ans[k] = m;
	}
	while(scanf("%d",&k),k != 0)
		printf("%d\n",ans[k]);
	return 0;
}
/*测试结果：通过POJ1012检测
2
7
3
5
4
30
12
1358657
13
2504881
8
7632
0
请按任意键继续. . .
*/