LIGHT OJ 1179 - Josephus Problem【约瑟夫(模板)】
2016-09-20 23:35
567 查看
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.
Each case contains two positive integers n (1 ≤ n ≤ 105) and k (1 ≤ k < 231).
被错误的误导了,好久才理解......
原来就是递推呀 看成递归就好了: N=1: f
=0; N>1 : f
=(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;
}
PDF (English) | Statistics | Forum |
Time Limit: 2 second(s) | Memory Limit: 32 MB |
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
=0; N>1 : f
=(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;
}
相关文章推荐
- TextView 字体过长解决方案(实现手动滚动字体)
- C++对象数组调用构造/析构函数的方法
- 【Mybatis】Mybatis增删改查操作
- iOS开发 Xcode8 如何适配iOS10
- (笔记)Spring实战_Spring之旅(2)_容纳你的Bean
- LeetCode 371. Sum of Two Integers
- 堆和栈 各种变量存储位置
- ReactiveCocoa入门教程:第二部分
- HDU 3018 Ant Trip 一笔画问题
- Xml帮助类
- 【转】十个JavaScript中易犯的小错误,你中了几枪?
- 迷惘。。。。。。。
- 一道面试题的解答_骑士获得金币问题
- 手势操作
- 01背包
- SSH如何通过公钥连接云服务器
- SpringMVC学习指南-前言
- 揭露QPS增高后的秘密
- Xcode下的DerivedData文件
- 性能测试