LIGHT OJ 1179 - Josephus Problem【约瑟夫(模板)】
来源:互联网 发布:知凡生物 编辑:程序博客网 时间:2024/05/21 06:53
1179 - Josephus Problem
The historian Flavius Josephus relates how, in the Romano-Jewish conflict of 67 A.D., the Romans took the town of Jotapata which he was commanding. Escaping, Josephus found himself trapped in a cave with 40 companions. The Romans discovered his whereabouts and invited him to surrender, but his companions refused to allow him to do so. He therefore suggested that they kill each other, one by one, the order to be decided by lot. Tradition has it that the means for affecting the lot was to stand in a circle, and, beginning at some point, count round, every third person being killed in turn. The sole survivor of this process was Josephus, who then surrendered to the Romans. Which begs the question: had Josephus previously practiced quietly with 41 stones in a dark corner, or had he calculated mathematically that he should adopt the 31st position in order to survive?
Now you are in a similar situation. There are n persons standing in a circle. The persons are numbered from 1 to ncircularly. For example, 1 and n are adjacent and 1 and 2 are also. The count starts from the first person. Each time you count up to k and the kth person is killed and removed from the circle. Then the count starts from the next person. Finally one person remains. Given n and k you have to find the position of the last person who remains alive.
Input
Input starts with an integer T (≤ 200), denoting the number of test cases.
Each case contains two positive integers n (1 ≤ n ≤ 105) and k (1 ≤ k < 231).
Output
For each case, print the case number and the position of the last remaining person.
Sample Input
Output for Sample Input
6
2 1
2 2
3 1
3 2
3 3
4 6
Case 1: 2
Case 2: 1
Case 3: 3
Case 4: 3
Case 5: 2
Case 6: 3
被错误的误导了,好久才理解......
原来就是递推呀 看成递归就好了: N=1: f[N]=0; N>1 : f[N]=(f[N-1]+M)%N;
AC代码:
#include<cstdio>int main(){int N,M,T,i,Kase=0;scanf("%d",&T);while(T--){scanf("%d %d",&N,&M); int ans=0; for(i=2;i<=N;++i) ans=(ans+M)%i; printf("Case %d: %d\n",++Kase,ans+1); } return 0;}
- LIGHT OJ 1179 - Josephus Problem【约瑟夫(模板)】
- Light oj 1179 - Josephus Problem 【思维】
- 约瑟夫问题(Josephus problem)
- 约瑟夫问题(Josephus Problem)
- 约瑟夫问题(Josephus problem)
- lightoj 1179 - Josephus Problem 约瑟夫问题
- lightoj 1179 - Josephus Problem 【约瑟夫环】
- lightoj 1179 - Josephus Problem 约瑟夫环
- 约瑟夫环问题(josephus problem)详解
- Algorithm Gossip: 约瑟夫问题(Josephus Problem)
- Josephus Problem (约瑟夫环数学解法)
- 约瑟夫(Josephus problem)环问题初探
- Java-约瑟夫问题(Josephus Problem)
- 关于约瑟夫问题(Josephus Problem)
- 约瑟夫问题(Josephus problem)
- Josephus problem(约瑟夫问题)
- 约瑟夫问题Josephus problem
- 约瑟夫问题(Josephus problem)1:出列的序列
- 源码角度讲解子线程创建Handler报错的原因
- Codeforces-368B-Sereja and Suffixes
- javascript编码规范
- rails 路由
- EDA软件_Protel99se生成gerber文件
- LIGHT OJ 1179 - Josephus Problem【约瑟夫(模板)】
- cancel事件
- 嵌入式培训第二阶段 第一星期 no.1 标准 I / O
- How to install Oh My Zsh on Ubuntu 14
- jmeter(三)maven 和jenkins
- Codeforces-492B-Vanya and Lanterns
- 使用WireShark分析HTTP协议时几种常见的汉字编码
- String和StringBuffer类
- 左移右移的思考