hoj1016 Joseph's problem I

oseph's problem I

My Tags	(Edit)

	Source : Unknown
	Time limit : 10 sec		Memory limit : 32 M

Submitted : 1725, Accepted : 536

The Joseph's problem is notoriously known. For those who are not familiar with the problem, among n people numbered 1,2...n, standing in circle every m_th 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 the message about the incident.

Although many good programmers have been saved since Joseph spread out this information, Joseph's cousin introduced a new variant of the malignant game. This insane character is known for its barbarian ideas and wishes to clean up the world from silly programmers. We had to infiltrate some the agents of the ACM in order to know the process in this new mortal game.

In order to save yourself from this evil practice, you must develop a tool capable of predicting which person will be saved.

The Destructive Process

The persons are eliminated in a very peculiar order; m is a dynamical variable, which each time takes a different value corresponding to the prime numbers' succession (2,3,5,7...). So in order to kill the ith person, Joseph's cousin counts up to the i_th prime.

Input

It consists of separate lines containing n [1..3501], and finishes with a 0.

Output

The output will consist in separate lines containing the position of the person which life will be saved.

Sample Input

6

Sample Output

4

约瑟夫问题的变种，每次m从固定次数变为素数次

先处理素数，再从后往前推 m变为m[i]注意此时i为（n-i）

code：

#include <iostream>
using namespace std;
int top=0;
bool prime(int a)
{
for(int i=2;i*i<=a;i++)
if(a%i==0) return false;
return true;
}
int m[3600];
int main()
{
int t;
for(int i=2;top<=3505;i++)
if(prime(i))
{
m[top]=i;
top++;
}
while(cin>>t)
{
if(t==0) break;
int result=0;
for(int i=t-2;i>=0;i--)
result=(result+m[i])%(t-i);
cout<<result+1<<endl;
}
return 0;
}