poj 3517 And Then There Was One(约瑟夫问题)【模板】
来源:互联网 发布:qq浏览器mac版官网 编辑:程序博客网 时间:2024/05/19 10:38
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 khops 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.
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.
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.
8 5 3100 9999 9810000 10000 100000 0 0
1932019
【题解】
著名的约瑟夫环问题,比较简单,见代码:
#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>using namespace std;const int N=10005;int m,n,a[N];int k,ans,sum,w;int main(){ while(~scanf("%d%d%d",&n,&k,&m),n+m+k) { for(int i=1;i<=n;++i) a[i-1]=i; a[m-1]=0; for(int i=m-1;i<n-1;i++) { a[i]=a[i+1]; } n--; int x=m-1; while(n!=1) { x=(x+k-1)%n; for(int i=x;i<n-1;++i) a[i]=a[i+1]; n--; } printf("%d\n",a[0]); } return 0;}
- poj 3517 And Then There Was One(约瑟夫问题)【模板】
- POJ-3517 And Then There Was One (约瑟夫环模板)
- poj 3517 And Then There Was One 约瑟夫问题
- POJ 3517 And Then There Was One(约瑟夫环)
- POJ 3517 And Then There Was One (约瑟夫环问题)
- POJ 3517 And Then There Was One 约瑟夫环
- POJ 3517 And Then There Was One 约瑟夫环
- POJ 3517 And Then There Was One (递推,约瑟夫问题变形)
- POJ 3517 And Then There Was One(约瑟夫环-递推or模拟)
- POJ题目3517 And Then There Was One(约瑟夫,公式)
- POJ 3517 And Then There Was One
- POJ-3517-And Then There Was One
- POJ 3517 And Then There Was One
- POJ 3517 And Then There Was One
- Poj 3517 And Then There Was One Joseph环问题
- POJ 3157 And Then There Was One【约瑟夫变形】
- UVALive 3882 And Then There Was One 约瑟夫环问题
- And Then There Was One----约瑟夫环
- Map集合
- python3.6.1 django1.11.4 初探
- 解决跨域问题
- python数据结构之栈
- ubuntu永久修改主机名
- poj 3517 And Then There Was One(约瑟夫问题)【模板】
- HDU 6090 Rikka with Graph
- Android开发 第二季 第1课 Debug 调试程序
- 使用LinkedList模拟栈数据结构的集合
- BPM平台介绍
- js下IE和FF的一些兼容写法总结
- POJ
- CVE-2017-8464 转载poc
- 预处理的学习