Joseph
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 57612 | Accepted: 21938 |
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.
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
方法并不难,m从2开始循环遍历即可,关键在于怎么用m对剩余人数取余,并根据余数进行移动。
代码如下:
#include<cstdio>
#include<cstring>
int a[50],b[50];
int joseph[15]={0};
int move(int len,int tmp,int i)
{
int j=i;
while(tmp)
{
if(j+1<=len)
j++;
else
j=1;
if(a[j]!=0)
tmp--;
}
return j;
}
int main()
{
int k;
while(scanf("%d",&k)!=EOF&&k)
{
if(joseph[k])
{
printf("%d\n",joseph[k]);
continue;
}
int m;
int len=k*2;
for(int i=1;i<=k;i++)
{
b[i]=1;
b[i+k]=2;
}
for(int i=2;;i++)
{
int t=len;
int j=0;
memcpy(a,b,sizeof(b));
while(t>k)
{
int tmp=i%t;
if(tmp==0)
tmp=t;
j=move(len,tmp,j);
if(a[j]==2)
{
a[j]=0;
t--;
}
else
break;
}
if(t==k)
{
m=i;
joseph[k]=m;
break;
}
}
printf("%d\n",m);
}
return 0;
}