POJ题目3517 And Then There Was One(约瑟夫,公式)
来源:互联网 发布:沈阳seo引擎优化软件 编辑:程序博客网 时间:2024/06/10 12:09
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 numbersk and m. From this state, remove stones one by one following the rules explained below, until only one remains. In step 1, remove stonem. 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, makek 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 sincem = 3.
Step 2: You start from the slot that was occupied by stone 3. You skip four stones 4, 5, 6 and 7 (sincek = 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
Japan 2007
本想再练练SBT,懒得写了,,因为输出最后一个,,直接用公式过了,
题目大意:输入n(n个数),k步数,m开始的地方
ac代码
Problem: 3517 User: kxh1995 Memory: 164K Time: 16MS Language: C++ Result: Accepted Source Code #include <cstdio>#include <iostream>#include <cstring>#include<stdio.h>#include<string.h>int f[100100];int main(){int n,k,m;while(scanf("%d%d%d",&n,&k,&m)!=EOF,n||m||k){f[1]=0;for(int i=2;i<n;i++){f[i]=(f[i-1]+k)%i;}f[n]=(f[n-1]+m)%n;printf("%d\n",f[n]+1);}}
- 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 3157 And Then There Was One【约瑟夫变形】
- And Then There Was One----约瑟夫环
- uva 1394 - And Then There Was One(约瑟夫环)
- UVA-1394-And Then There Was One(约瑟夫环)
- poj3517 And Then There Was One(约瑟夫环)
- AX系统金额缩写MST的含义
- 计算机概论总结
- Nutch-1.x学习笔记
- Swift 字典的常用方法
- 题目1 : Beautiful String
- POJ题目3517 And Then There Was One(约瑟夫,公式)
- Struts2学习笔记----阿冬专栏
- Java io nio
- FT:在锁屏界面的上面自己的view
- Android之EditText特殊小技巧
- MySQL存储过程详解
- java实现简单算法(二)-Armstrong数(枚举法)
- %TYPE 与 %ROWTYPE
- Leetcode#34||Search for a Range