poj2517And Then There Was One 约瑟夫问题
来源:互联网 发布:网络作家跳舞 编辑:程序博客网 时间:2024/05/17 23:45
Description
Let’s play a stone removing game.
Initially, n stones are arranged on a circle and numbered 1, …, n clockwise (Figure 1). You are also given two numbers k and m. From this state, remove stones one by one following the rules explained below, until only one remains. In step 1, remove stone m. In step 2, locate the k-th next stone clockwise from m and remove it. In subsequent steps, start from the slot of the stone removed in the last step, make k hops clockwise on the remaining stones and remove the one you reach. In other words, skip (k − 1) remaining stones clockwise and remove the next one. Repeat this until only one stone is left and answer its number. For example, the answer for the case n = 8, k = 5, m = 3 is 1, as shown in Figure 1.
Initial state
Step 1
Step 2
Step 3
Step 4
Step 5
Step 6
Step 7
Final state Figure 1: An example game
Initial state: Eight stones are arranged on a circle.
Step 1: Stone 3 is removed since m = 3.
Step 2: You start from the slot that was occupied by stone 3. You skip four stones 4, 5, 6 and 7 (since k = 5), and remove the next one, which is 8.
Step 3: You skip stones 1, 2, 4 and 5, and thus remove 6. Note that you only count stones that are still on the circle and ignore those already removed. Stone 3 is ignored in this case.
Steps 4–7: You continue until only one stone is left. Notice that in later steps when only a few stones remain, the same stone may be skipped multiple times. For example, stones 1 and 4 are skipped twice in step 7.
Final State: Finally, only one stone, 1, is on the circle. This is the final state, so the answer is 1.
Input
The input consists of multiple datasets each of which is formatted as follows.
n k m
The last dataset is followed by a line containing three zeros. Numbers in a line are separated by a single space. A dataset satisfies the following conditions.
2 ≤ n ≤ 10000, 1 ≤ k ≤ 10000, 1 ≤ m ≤ n
The number of datasets is less than 100.
Output
For each dataset, output a line containing the stone number left in the final state. No extra characters such as spaces should appear in the output.
Sample Input
8 5 3100 9999 9810000 10000 100000 0 0
Sample Output
1932019
Source
using namespace std;
int main()
{
long long n,k,m;
while(cin>>n>>k>>m)
{
if(n==0&&k==0&&m==0) break;
int result=0;
for(int i=1;i<n;i++)
result=(result+k)%i;
result=(result+m)%n+1;
cout<<result<<endl;
}
return 0;
}
- poj2517And Then There Was One 约瑟夫问题
- UVALive 3882 And Then There Was One 约瑟夫环问题
- poj 3517 And Then There Was One 约瑟夫问题
- And Then There Was One----约瑟夫环
- POJ 3517 And Then There Was One (递推,约瑟夫问题变形)
- 约瑟夫问题变形 And Then There was One, LA 3882 递推 动态规划
- 约瑟夫问题的变形(And Then There Was One,Japan 2007,LA 3882)
- POJ 3517 And Then There Was One (约瑟夫环问题)
- UVALive - 3882 And Then There Was One 约瑟夫的变形问题
- 例26 约瑟夫问题的变形(And Then There Was One,Japan 2007,LA 3882)
- UVALive 3882--And Then There Was One+约瑟夫环问题变形
- 1394 - And Then There Was One(约瑟夫问题变形)DP
- poj 3517 And Then There Was One(约瑟夫问题)【模板】
- POJ 3517 And Then There Was One 约瑟夫环
- POJ 3517 And Then There Was One 约瑟夫环
- LA 3882 - And Then There Was One(约瑟夫 递归)
- uva 1394 - And Then There Was One(约瑟夫环)
- And Then There Was One +dp+约瑟夫环的变形
- 关于重装系统时读取不到硬盘和设置主板AHCI蓝屏问题
- HTTPS过程详解
- 有两个循环单链表,头指针分别是head1和head2,实现算法将链表head2连接到head1之后,连接后的链表仍然是循环链表的形式
- android 用aidl实现进程间的通信
- Android开发帮助文档Doc打开速度慢解决_Python篇
- poj2517And Then There Was One 约瑟夫问题
- 低功耗设计二之Bypassing(旁路)
- URAL 1057 Amount of Degrees (数位DP)
- 约瑟夫问题用链表实现
- 冬令营二月四号工作日志
- 两种Eclipse UML 插件ModelGoon和AmaterasUML
- TOP K问题
- overfitting(过度拟合)的概念
- Overfitting and Underfiting