HDOJ题目1443Joseph(数学)
来源:互联网 发布:龙虎榜持仓数据变化表 编辑:程序博客网 时间:2024/06/06 03:08
Joseph
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1666 Accepted Submission(s): 1041
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
Source
ACM暑期集训队练习赛(5)
Recommend
lcy | We have carefully selected several similar problems for you: 1444 1452 1725 1393 1370
ac代码
#include<stdio.h>#include<math.h>#include<string.h>int v[250];int find(int k,int m){int n,a=1;for(n=1;n<=k;n++){a=(a+m-1)%(2*k-n+1);if(a==0)a=2*k-n+1;if(a<=k&&a>=1)return 0;}return 1;}int main(){int k;while(scanf("%d",&k)!=EOF,k){int m,r,h,w=0;if(!v[k]){for(r=0;;r++){for(h=k+1;h<=2*k;h++){m=2*k*r+h;if(find(k,m)){w=1;break;}}if(w)break;}}if(!v[k])v[k]=m;printf("%d\n",v[k]);}}
0 0
- HDOJ题目1443Joseph(数学)
- HDOJ 1443 Joseph(打表+数学—约瑟夫环)
- POJ 题目1012Joseph(数学,约瑟夫环)
- HDOJ 1443 joseph (找规律)
- HDOJ 1443 Joseph again
- hdoj 1443 Joseph【水】
- hdoj 1443 Joseph【约瑟夫环】
- HDOJ 题目1060Leftmost Digit(数学)
- HDOJ题目2086 A1 = ?(数学)
- HDOJ题目2529shot(数学)
- HDOJ题目1220 Cube(组合数学)
- HDOJ题目1701ACMer(数学)
- HDOJ 题目2178 猜数字(数学)
- HDOJ 题目3908Triple(数学)
- HDOJ 题目1211RSA(数学)
- HDOJ 题目1061Rightmost Digit(数学)
- HDOJ 题目1722 Cake(数学)
- HDOJ 题目2289 Cup(数学,二分)
- 静态代码扫描学习
- ios缓存机制详解
- 第九周项目六 百钱百鸡问题
- oracle约束总结(not null/unique/primary key/foreign key/check)
- 长春径点笔试C++常见概念题
- HDOJ题目1443Joseph(数学)
- Flex中TabNavigator隐藏和显示选项卡
- 线程锁
- Lucene 简介
- 顺序容器的使用
- ubuntu 下创建桌面快捷启动方式
- day64,page80
- 面向对象--初始化块
- 使用Flask搭建一个流媒体服务器