POJ-1012-Joseph-Joseph-easy.txt

/**
POJ-1012-Joseph
2015-10-15 22:37:00
xuchen
**/
#include "stdio.h"
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;

const int K = 19;
int ans[K];
int Joseph[K];

int main()
{
	int k, n, m;
	while(scanf("%d",&k))
	{
		if(k==0)
			break;

		if(Joseph[k])
		{
			printf("%d\n", Joseph[k]);
			continue;
		}

		n = 2*k;
		m = 1;
		for(int i=1; i<=k; i++)
		{
			ans[i] = (ans[i-1]+m-1)%(n-i+1);
			if(ans[i]<k)
			{
				i=0;
				m++;
			}
		}
		Joseph[k] = m;
		printf("%d\n", m);
	}
	return 0;
}