http://poj.org/problem?id=1012
Joseph
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 41068 | Accepted: 15468 |
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
Source
http://baike.baidu.com/view/213217.htm
#include<iostream>
using namespace std;
int a[15];
int f(int k,int m)
{
int n,i,s=0;
n=2*k;//一共有2*k个人
for(i=0;i<k;i++)//判断当小孩子为2*k时出局数为m时是否满足条件,如果满足返回1,否则返回0
{
s=(s+m-1)%(n-i);//计算公式
if(s<k)//前K个退出的人必定是后K个人,所以只要前k轮中只要有一次f(i)<k则此m不符合题意。
return
0;//遇到前k轮有小于k的直接返回
}
return 1;
}
int main()
{
int i,k,n;
for(k=1;k<=14;k++)//通过打表,吧所用的情况有记录在表格a[]中
{
i=k+1;
while(1)
{
if(f(k,i))//t(k+1)情况
{
a[k]=i;
break;
}
else
if(f(k,i+1))//t(k+1)+1的情况
{
a[k]=i+1;//*****************
break;
}
i+=k+1;//下一个要删除的位置
}
}
while(scanf("%d",&n)!=EOF)
{
if(n==0)
break;
printf("%d\n",a[n]);
}
return 0;
}
#include<iostream>
using namespace std;
int a[15];
int f(int k,int m)
{
}
int main()
{
}