♥HDOJ 1443-Joseph【约瑟夫环+规律】
来源:互联网 发布:傲剑坐骑升级数据 编辑:程序博客网 时间:2024/05/17 07:29
Joseph
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2247 Accepted Submission(s): 1366
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)
解题思路:
保留前面的k个人,报数踢掉后面的人,如果要做到这样我们会注意到,只需要更新最开头的那个数,直到开头那个数大于k。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[1200],b[1200];int main(){int n;while(scanf("%d",&n)!=EOF){if(n==0)break;if(b[n]!=0){printf("%d\n",b[n]);continue;}int i,j;int k=n;n=n*2;int m=1;a[0]=0;for(i=1;i<=k;i++)//1~k号是保留的 一直更新a【1】当他比k大时就是我们要找的结果 {a[i]=(a[i-1]+m-1)%(n-i+1);if(a[i]<k){m++;i=0;} }b[k]=m;printf("%d\n",b[k]);}return 0;}
1 0
- ♥HDOJ 1443-Joseph【约瑟夫环+规律】
- hdoj 1443 Joseph【约瑟夫环】
- hdoj Joseph 1443 (约瑟夫环&打表)
- HDOJ 1443 Joseph(打表+数学—约瑟夫环)
- HDOJ 1443 joseph (找规律)
- hdu 1443 joseph (约瑟夫环模拟)
- HDU 1443 Joseph 约瑟夫环问题
- hdu 1443 Joseph (约瑟夫环)
- HDU 1443 Joseph 约瑟夫环 暴力
- hdu 1443 Joseph (约瑟夫环)
- 约瑟夫环(joseph)
- Joseph Circle(约瑟夫环)
- poj1012 -- Joseph (约瑟夫环)
- 约瑟夫环问题(joseph)
- HDOJ 1443 Joseph again
- hdoj 1443 Joseph【水】
- poj 1012 Joseph(约瑟夫环)
- Poj 1012 Joseph (约瑟夫环)
- 29.Android展示PDF文件
- 【源码解读】Screencap源码分析-基础篇
- 【Android 基础】Animation 动画介绍和实现
- 【Python】time模块详解
- Java堆栈存储数据类型
- ♥HDOJ 1443-Joseph【约瑟夫环+规律】
- JS判断页面首次访问
- hive函数--排序row_number,rank over
- HDOJ 2102 A计划
- 大数据在线分析处理和常用工具
- IOS 网络浅析-(十二 UIWebView简介)
- xpath获取子孙元素
- Failed to load Main-Class manifest attribute from
- [安卓开发笔记二]android Studio通过jni调用C++代码