UVALive3882-And Then There Was One-约瑟夫问题-递推
2017-07-20 17:37
465 查看
And Then There Was One
Time limit: 3.000 seconds
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: 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 3
100 9999 98
10000 10000 10000
0 0 0
Sample Output
1
93
2019
题意就是约瑟夫问题,看人家的博客吧。
传送门1:http://www.cnblogs.com/shanyr/p/5213631.html
传送门2:http://blog.csdn.net/hyczms/article/details/43817799
公式写上就可以a了。
代码:
Time limit: 3.000 seconds
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: 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 3
100 9999 98
10000 10000 10000
0 0 0
Sample Output
1
93
2019
题意就是约瑟夫问题,看人家的博客吧。
传送门1:http://www.cnblogs.com/shanyr/p/5213631.html
传送门2:http://blog.csdn.net/hyczms/article/details/43817799
公式写上就可以a了。
代码:
#include<bits/stdc++.h> using namespace std; const int N=1e5+10; int a ; int main(){ int n,k,m,cnt; while(~scanf("%d%d%d",&n,&k,&m)&&n){ a[1]=0; for(int i=2;i<=n;i++) a[i]=(a[i-1]+k)%i; cnt=(a +m-k+1)%n; if(cnt<=0) cnt+=n; printf("%d\n",cnt); } return 0; }
相关文章推荐
- UVALive - 3882 And Then There Was One 约瑟夫的变形问题
- UVALive 3882 - And Then There Was One【约瑟夫问题】
- UVALive 3882 And Then There Was One 约瑟夫环问题
- UVALive 3882 And Then There Was One 约瑟夫环问题
- UVALive - 3882 And Then There Was One (递推[dp])
- 约瑟夫问题变形 And Then There was One, LA 3882 递推 动态规划
- 约瑟夫问题变形 And Then There was One, LA 3882 递推 动态规划
- uva live 3882 And Then There Was One 约瑟夫环
- POJ 3517 And Then There Was One (递推,约瑟夫问题变形)
- UVALive - 3882 And Then There Was One (约瑟夫环变形)@
- LA 3882 And Then There Was One[约瑟夫问题的变形]
- UVALive 3882 And Then There Was One
- ecjtu-summer training #5 F - And Then There Was One UVALive - 3882
- UVALive 3882 And Then There Was One
- And Then There Was One UVALive - 3882
- UVALive - 3882:And Then There Was One
- UVa 3882 - And Then There Was One 递推------------无力orz
- UVa 3882 - And Then There Was One 递推------------无力orz
- UVa 3882 And Then There Was One(stl+有技巧的模拟||数学方法+约瑟夫问题)
- UVA 1394 POJ 3517 And Then There Was One (双向循环链表和递推)