HDU 1443 Joseph
来源:互联网 发布:折800计入淘宝销量吗 编辑:程序博客网 时间:2024/05/21 09:29
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
这个算是约瑟夫坏问题吧,我这个是用数学方法暴力解决的,M从K+1开始穷举,如果穷举到了就返回M咯,还是算蛮简单的;
LANGUAGE:C++
CODE:
LANGUAGE:C++
CODE:
#include<stdio.h>int ans[14]={0};int joseph(int k){ int cnt,p; if(ans[k])return ans[k]; for(int i=k+1;;i++) { for(cnt=k<<1,p=0;cnt>k;cnt--) { p=(p+i-1)%cnt; if(p<k)cnt=0; } if(cnt==k) { ans[k]=i; return i; } } return 0;}int main(){ int n; while(scanf("%d",&n),n) { printf("%d\n",joseph(n)); } return 0;}
- HDU-1443 Joseph
- HDU--1443 Joseph
- HDU 1443 Joseph
- hdu 1443 Joseph
- hdu 1443 Joseph
- hdu -- 1443 Joseph
- HDU 1443 Joseph
- HDU 1443 Joseph
- HDU 1443 Joseph
- HDU 1443 Joseph
- hdu 1443 Joseph
- HDU-1443 Joseph
- hdu 1443 Joseph
- HDU 1443 Joseph
- hdu 1443 Joseph
- HDU-1443 Joseph
- HDU 1443 Joseph
- HDU 1443 Joseph
- 如何在Drupal当中调用hook?
- linux CFS 虚拟时间更新
- 初识iOS中的通知中心【图文+视频】
- :-P
- 一线网页游戏程序员日志 (二十四)
- HDU 1443 Joseph
- Objective-C中init函数(self=[super init])实现的相关研究
- android-adb shell命令
- BNU 0817 A 0 or 1
- winxp下安装win98/win2000
- WindowsXP下调制解调器的安装及设置
- 数据结构笔记一(20120819)
- 安装Windows XP后的五个设置步骤
- windowsXP中设置邮件账号