hdu 1443 Joseph
2016-03-14 00:14
351 查看
Joseph |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 2547 Accepted Submission(s): 1456 |
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. |
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 340 |
Sample Output 530 |
#include <iostream> using namespace std; int joseph[20]; int f[20]; int main() { int k,m,i; while(cin>>k && k) { if(joseph[k]!=0) { cout << joseph[k] <<endl; continue; } m = k+1; int n = 2*k; for(i=1;i<=k;i++) { f[i] = (f[i-1] + m-1)%(n-i+1); if(f[i]<k) { m++; i = 0; continue; } } joseph[k] = m; cout << joseph[k] << endl; } //cout << "Hello world!" << endl; return 0; }
相关文章推荐
- 多线程 的理解(一)
- 数据结构(4)线性表之链式表示
- RxJava初步学习总结
- caffe term: epoch, itr
- Effective Java读书笔记(一):类、接口、对象
- 图型dp csu1700 Black Company
- git在Mac Capitan系统下出错解决方法
- 使用JDK中的类URL访问HDFS(来自吴超Hadoop)
- 《JavaScript语言精粹》笔记
- oom处理
- 自动拆装箱与x类型
- [CodeForces 126C]E-reader Display[实现]
- Javascript猜数字游戏
- 机电传动控制第二周学习笔记
- HTML5标签
- 序列化/反序列化/序列化事件/加解密
- 【一周读书】All life is problem solving
- LAMP搭建UCenter
- UIView的常见属性
- 九章算法6:Linked List