pojJoseph 约瑟夫环问题
2014-02-28 19:08
369 查看
Joseph
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
Sample Output
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 46332 | Accepted: 17459 |
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
#include <stdio.h> #include <stdlib.h> #include <string.h> #include<iostream> using namespace std; int main () { // freopen ("t.txt", "r", stdin); int k, answer;//答案 int count;//计数去掉了几个人 int next;//下一个要去掉的人的编号 0~2k-1 int rest;//去掉剩下几个人了 int cache[20];//如果不缓存计算结果会TLE|| memset(cache, 0, sizeof(cache)); while (scanf("%d", &k) != EOF && k != 0) { answer = k; while (!cache[k]) { count = 0; rest = 2*k; answer++; next = 0; //cout<<"answer="<<answer<<endl; while(1) { if (count == k) { cache[k] = answer; break; } next = (next + answer - 1) % rest; //cout<<"next="<<next<<endl; if (next < k) //因为好人不会先去掉,所以直接判断去掉的人编号是不是属于0~k-1的 break; count++; rest--; } } printf("%d\n", cache[k]); } return 0; }
相关文章推荐
- NYOJ 191 && POJ 1012 Joseph(约瑟夫环问题)
- NYOJ 191 && POJ 1012 Joseph(约瑟夫环问题)
- POJ 3517 And Then There Was One (约瑟夫环问题)
- POJ 题目1012Joseph(数学,约瑟夫环)
- 约瑟夫环 poj 3750 小孩报数问题 模拟
- poj 1012 Joseph 约瑟夫问题 (★★☆☆☆)
- (hdu step 2.2.2)Joseph(约瑟夫环变形问题)
- poj 1012 Joseph 约瑟夫环变形
- (顺序表的应用5.4.3)POJ 1012(约瑟夫环问题——保证前k个出队元素为后k个元素)
- HDU 1443 Joseph 约瑟夫环问题
- poj 1012 -- Joseph (约瑟夫环)
- POJ 1012 Joseph(约瑟夫环)(枚举)
- POJ 1012 && HDU 1443 Joseph(约瑟夫问题)
- poj 1012 Joseph环问题
- 约瑟夫环问题(joseph)
- (顺序表的应用5.4.2)POJ 1591 M*A*S*H(约瑟夫环问题的变形——变换步长值)
- 【原】 POJ 3517 And Then There Was One Joseph问题 解题报告
- poj 1012 Joseph (约瑟夫问题)
- POJ 2886 Who Gets the Most Candies? (线段树 约瑟夫环问题变种)
- poj1012Joseph(约瑟夫环)