(约瑟夫环公式)Joseph
来源:互联网 发布:哈登16 17赛季数据 编辑:程序博客网 时间:2024/06/05 19:15
Joseph
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)
Recommend
lcy
总结:
利用数学规律来做,约瑟夫环的递推公式
F(n) = (F(n-1) + m) % t
可以算出地n次出局的人,t为目前的总人数
这道题的思路就是出局K个人,这K个人里面不能是前K个人里面的
,如果出局的K个人全部都是题意要求出局的人,那么 m 就是我们
要找的值.
在代码中的约瑟夫环公式是F(n) = (F(n-1) + (m-1)) % t
因为m的值可能要比t值大,这样结果可能会出现零,而我们的环里面并没有零这个位置,所以要调整一下,将我们的环调整为0 – 2k-1
,相应的m要减去1,这样,就可以避免处理余数为零的步骤
#include<iostream>#include<stdio.h>using namespace std;int ans[15];void table(){ for(int k=1; k<=13; ++k) { for(int m=k+1; ;m++) { int x=0,j,len=2*k; for(j=0; j<k; ++j) { x = (x+ (m-1) ) % (len-j); if(x < k) break; } if(j == k) { ans[k] = m; break; } } }}int main(void){ table(); int n; while(scanf("%d",&n) && n) { cout << ans[n]<<endl; } return 0;}
- (约瑟夫环公式)Joseph
- 约瑟夫环(joseph)
- Joseph (约瑟夫环(打表))
- Joseph - acm.uva.305(约瑟夫环)
- 华为笔试题目--约瑟夫环(Joseph)
- 数据结构之约瑟夫环(Joseph)
- poj 1012 -- Joseph (约瑟夫环)
- hdu 1443 joseph (约瑟夫环模拟)
- hdu 1443 Joseph (约瑟夫环)
- hdu 1443 Joseph (约瑟夫环)
- Joseph Circle(约瑟夫环)
- poj1012 -- Joseph (约瑟夫环)
- 约瑟夫环问题(joseph)
- 约瑟夫(Joseph)问题
- poj 1012 Joseph(约瑟夫环)
- Poj 1012 Joseph (约瑟夫环)
- PKU-1012 Joseph (约瑟夫环)
- POJ1012 Joseph 约瑟夫环 水题
- 最优化
- 锋利的jquery---ch1,
- 【HDU 2577】How to Type
- PHP 中如何正确统计中文字数
- ORACLE日期时间函数大全
- (约瑟夫环公式)Joseph
- JSP的第2代开发技术:JSP+EJB
- 欢迎使用CSDN-markdown编辑器
- ios蓝牙开发(三)app作为外设被连接的实现
- 知生涯—职业顾问—怎样平衡工作与家庭?
- Linux的GRUB简介
- unix时间戳转成date-oracle
- 搬砖中的小事之代码(七)---设置数据库中非空字段的默认值
- linux脚本实现ssh自动登陆远程桌面