Joseph
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 42151 | Accepted: 15858 |
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
///
这是一个约瑟夫问题,刚来时提交很多次都是因为TimeLimit, 后来看到网上的解题报告中说需要存储重复出现的测试数据,我保存在save数组中,结果就通过了。
//
/***********************
* 程序名:Joseph.cpp
* 功能:ACM
************************/
#include <iostream>
using namespace std;
int main()
{
int k, i, m, bad, p;
int save[14] = {0};
while(cin>>k && k != 0 && k < 14) {
if(save[k] != 0) {
cout<<save[k]<<endl;
continue;
}
for(m = k;;m++) {
i = 0;
bad = 0;
p = 2 * k;
while(bad != k) {
i += m;
i %= p;
if(i >= k) {
bad++;
p--;
}
else {
break;
}
}
if(bad == k) {
save[k] = m+1;
break;
}
}
cout<<save[k]<<endl; /*程序中题目的要求是1 2 3 ... n,代码从0开始的*/
}
return 0;
}