HDU Joseph【数学&&约瑟夫环】
来源:互联网 发布:数据库概念模型设计 编辑:程序博客网 时间:2024/06/09 23:17
Joseph
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2118 Accepted Submission(s): 1285
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.
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
以前做过一次约瑟夫环问题,不过没太明白当时大神的最优代码,这一次又见到了类似的题,只能无脑模拟了,不过暴力模拟,很果断的TLE了.......
找大神们的解析,加深了自己的理解,不过自己还是不太明白,貌似是,利用数学技巧,动态处理了,简化了很多东西...(自己说不明白了)
然后就是打表处理了.....
#include<stdio.h> #include<string.h>bool joseph(int k,int m){int bg=0,ed=k-1,tp;for(int n=2*k;n>k;--n){tp=(m-1)%n;if(tp>=bg&&tp<=ed){return 0;}bg=(bg-m%n+n)%n;ed=(ed-m%n+n)%n;//bg=((bg-m)%n+n)%n;ed=((ed-m)%n+n)%n;//同余还是理解的不够}return 1;}int main(){int n,y[20]={0};for(int i=1;i<14;++i){int j=i+1;while(1){if(joseph(i,j)){y[i]=j;break; }++j;} }//freopen("shuju.txt","r",stdin);while(scanf("%d",&n),n){printf("%d\n",y[n]);}return 0;}
0 0
- HDU Joseph【数学&&约瑟夫环】
- hdu 1443 joseph (约瑟夫环模拟)
- HDU 1443 Joseph 约瑟夫环问题
- hdu 1443 Joseph (约瑟夫环)
- HDU 1443 Joseph 约瑟夫环 暴力
- hdu 1443 Joseph (约瑟夫环)
- POJ 题目1012Joseph(数学,约瑟夫环)
- HDOJ 1443 Joseph(打表+数学—约瑟夫环)
- 约瑟夫环(joseph)
- Joseph Circle(约瑟夫环)
- poj1012 -- Joseph (约瑟夫环)
- 约瑟夫环问题(joseph)
- poj 1012 & hdu 1443 Joseph(约瑟夫环变形)
- (hdu step 2.2.2)Joseph(约瑟夫环变形问题)
- hdu 1443 Joseph(约瑟夫环+枚举)
- HDU ACM Step 2.2.2 Joseph(约瑟夫环问题)
- poj 1012 Joseph(约瑟夫环)
- Poj 1012 Joseph (约瑟夫环)
- HDU 1233 最小生成树和并查集
- linux下oracle lsnrctl stat后无反应而SQLPLUS正常的故障
- C++学习笔记(六) 面向对象
- homework-大扫除
- Websocket即时通信应用开发 JS部分
- HDU Joseph【数学&&约瑟夫环】
- C#中WinForm窗体的单例模式,避免窗体被实例化多次
- 16年1月份英语总结篇
- 搭建SpringMvc框架
- Java线上应用故障排查之二:高内存占用
- Miller-Rabin素数测试(被测数可以是小于2^63的正整数)
- dedecms万能SQL标签调用归纳
- opencv或者libvlc库这种遇到窗口句柄想要放到MFC中的处理代码如下:
- 剪发 Haircut