hdoj1443Joseph【约瑟夫环 打表】
2016-01-31 11:29
369 查看
Joseph
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2109 Accepted Submission(s): 1283
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
3
4
0
Sample Output
5
30
Source
ACM暑期集训队练习赛(5)
#include<cstdio> #include<cstdlib> #include<cstring> #include<algorithm> #include<cmath> #include<queue> #include<list> #include<vector> using namespace std; int kill(int n,int k,int i){ if(i==1) return (n+k-1)%n; else return (kill(n-1,k,i-1)+k)%n; } int f[15]; void dabiao(){ int i,m,k; for(k=1;k<14;++k){ for(m=k;;++m){ for(i=1;i<=k;++i){ if(kill(2*k,m,i)+1<=k)break; } if(i>k)break; } f[k]=m; } } int main() { dabiao(); int t,k,n,i,j; while(scanf("%d",&k),k){ printf("%d\n",f[k]); } return 0; }
相关文章推荐
- 线程练习题下
- A^X mod P 大幂分解求和 打表
- Android studio 多渠道打包
- Android之自定义dialog对话框
- 关键字 private
- 如何面试前端工程师:Github很重要
- CentOS 7 WIFI显示Hardware Disabled
- 线性表的链式表示和实现
- 从ICassFactory为CLSID为{17BCA6E8-A950-497E-B2F9-AF6AA475916F}的COM组件创建实例失败问题解决方法
- POJ 2823 Sliding Window
- python安装第三方库
- 【freeradius2.x】 安装和学习
- 【freeradius2.x】 安装和学习
- 创建Metasploit Payloads
- c#中取整,向上取,向下取
- linux 时间戳转换/dmesg 时间转换
- javascript变量类型
- 杭电hdu 5615 Jam's math problem【胡搞过】
- linux下安装redis,启动,停止,设置密码
- CC150 chapter 8 OOD object-oriented design