Joseph |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 2547 Accepted Submission(s): 1456 |
|
Problem Description The Joseph\\\\\\\'s problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., n, standing in circle every mth is going to be executed and only the life of the last remaining person will be saved. Joseph was smart enough to choose the position of the last remaining person, thus saving his life to give us the message about the incident. For example when n = 6 and m = 5 then the people will be executed in the order 5, 4, 6, 2, 3 and 1 will be saved.
|
Input The input file consists of separate lines containing k. The last line in the input file contains 0. You can suppose that 0 < k < 14.
|
Output
|
Sample Input 340
|
Sample Output 530 |
#include <iostream>
using namespace std;
int joseph[20];
int f[20];
int main()
{
int k,m,i;
while(cin>>k && k)
{
if(joseph[k]!=0)
{
cout << joseph[k] <<endl;
continue;
}
m = k+1;
int n = 2*k;
for(i=1;i<=k;i++)
{
f[i] = (f[i-1] + m-1)%(n-i+1);
if(f[i]<k)
{
m++;
i = 0;
continue;
}
}
joseph[k] = m;
cout << joseph[k] << endl;
}
//cout << "Hello world!" << endl;
return 0;
}