Time Limit: 5000MS | Memory Limit: 65536K | |
Total Submissions: 5100 | Accepted: 2743 |
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 |
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
题意:给定N M K ,N:总石头数 M:起始位置 K:每次数K个 , 求最后一个石头的编号;
思路: 1,2,3....M-1,M,M+1,....N-1,N 变换成1,2,3......N-2,N-1 其中M-1对应N-1 M+1对应1 这时候就用模型求出最后一个人的在最后一列数中的编号 然后转换一下即可;
失误: 1.模型没理解透彻,应用不够熟练 变量对应意义掌握不熟练 大小都写错 2.(ans%mod+mod)%mod是最下非负解 可以为0,注意题目不能输出0;
AC代码:
#include<cstdio>
int main()
{
int N,K,M;
while(~scanf("%d %d %d",&N,&K,&M),N||K||M)
{
int ans=0,i=0;
for(i=2;i<=N-1;++i) ans=(ans+K)%i;
ans=(ans+1+M)%N;
if(!ans) ans=N;
printf("%d\n",ans);
}
return 0;
}