Joseph
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2214 Accepted Submission(s): 1345
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.
Suppose that there are k good guys and k bad guys. In the circle the first k are good guys and the last k bad guys. You have to determine such minimal m that all the bad guys will be executed before the first good guy.
Suppose that there are k good guys and k bad guys. In the circle the first k are good guys and the last k bad guys. You have to determine such minimal m that all the bad guys will be executed before the first good guy.
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
The output file will consist of separate lines containing m corresponding to k in the input file.
Sample Input
3 4 0
Sample Output
5 30
题意:2*k个人站成一个环,前k个人是好人,后k个人是坏人。每次都杀死环中的第m个人,要求在杀死第一个好人之前杀光所有的坏人,问这个m为多大?
题解:先用队列模拟,超时了。直接用数学规律做,打表能过。
代码如下:
#include<cstdio>
#include<cstring>
int a[14];
void table()
{
int k,m,s,x,cnt;
for(k=1;k<14;++k)
{
for(m=k+1;;++m)
{
s=0; cnt=2*k;
while(1)
{
x=(s+m)%cnt;
if(!x)
x=cnt;
if(x<=k)
break;
s=x-1;
cnt--;
if(cnt==k)
{
a[k]=m;
break;
}
}
if(cnt==k)
break;
}
}
}
int main()
{
table();
int k;
while(scanf("%d",&k)&&k)
printf("%d\n",a[k]);
return 0;
}