HIT OJ 1016 - Joseph‘s problem I

问题描述

Problem Description

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 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 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 ith 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

Hint

There are up to 50000 cases in one test, so please choose a faster algorithm.

问题分析

原来的约瑟夫问题，每次挑选要杀掉的人是使用一个固定的数字$n$,这个问题里则使用了动态的数字，即质数序列

事先准备

质数序列求取 无需赘述，使用筛法，求取3501个质数备用

思路分析

最简单的办法自然是模拟，假设最初有$m$个人，杀掉第$n$个，剩下的人重新排序，算法复杂度 $O(n^2)$

假设，目前有$m$个人，编号$1,......,m$, 杀掉编号为$n$的人，原来编号为$x$的人(假设这个人没被干掉)，下一轮的编号应该是什么？

原序列
$$1,2,3,.....,n-1,n,n+1,.....,x,......,m$$

$n$被干掉后，新序列为
$$1,......,x-n,......,m-n,1+(m-n),2+(m-n),3+(m-n),......,n-1+(m-n)$$
显然有 $$x^{\prime }=x+(m-n)\%m\text{\hspace{1em}(1)}$$
而假设，有$m$个人,杀掉第$l$个人,其编号为$n$，则
$$n=(l\%m)if(l\%m!=0)else(m)\text{\hspace{1em}(2)}$$
则
$$\begin{gathered} x^{\prime }=(x+m-l\%m)\%m,l\%m!=0 \\ {x}^{\prime }=(x+m-m)\%m,l\%m=0\text{\hspace{1em}(3)} \end{gathered}$$
由（3）得，幸存下来的$x$的新编号$x^{\prime }$为
$$x^{\prime }=(x+m-l\%m)\%m\text{\hspace{1em}(4)}$$
反推，若已知当前有$m-1$个人，且上一轮幸存者$x$在这一轮的编号为$x‘$,上一轮干掉了第$l$个人，则
$$\begin{gathered} x^{\prime \prime }=(x^{\prime }+l\%m)\%m \\ x=x^{\prime \prime },if{x}^{\prime \prime }>0,else,m\text{\hspace{1em}(5)} \end{gathered}$$

解法

这样一来，问题就简单了。
假设最初有$m$个人，$prim{e}_i$代表第$i$个质数，最后留下来的人的编号肯定为$1$,且上一轮人数为2,且上一轮干掉了第$prim{e}_{m-1}$个人，则按照式(5)依次递推幸存者上次的编号。

Hint

根据hint中的提示，共有5000个case,但是可能的input范围为[1,3501],也就是说有很多case是重复的，所以可以开一个数组，存储当前计算后的值，下次直接从数组中取就可以了