poj 1012 Joseph

#include <iostream>
using namespace std;

int main()
{
int k,n,pos,ans;
int jos[15];
memset(jos,0,sizeof(jos));
while(cin>>k&&k)
{
ans=0;
if(jos[k]==0)
while(1)
{
n=2*k;pos=0;
ans++;
while(1)
{

pos=(pos+ans)%n;
if(pos>k-1)
{

n--;
}
else break;
}
if(n==k){jos[k]=ans;break;}
}
cout<<jos[k]+1<<endl;
}
return 0;
}