In a serious attempt to downsize (reduce) the dole queue, The New National Green Labour Rhinoceros Party has decided on the following strategy. Every day all dole applicants will be placed in a large circle, facing inwards. Someone is arbitrarily chosen as number 1, and the rest are numbered counter-clockwise up to N (who will be standing on 1’s left). Starting from 1 and moving counter-clockwise, one labour official counts off k applicants, while another official starts from N and moves clockwise, counting m applicants. The two who are chosen are then sent off for retraining; if both officials pick the same person she (he) is sent off to become a politician. Each official then starts counting again at the next available person and the process continues until no-one is left. Note that the two victims (sorry, trainees) leave the ring simultaneously, so it is possible for one official to count a person already selected by the other official.
Input
Write a program that will successively read in (in that order) the three numbers (N, k and m; k, m > 0, 0 < N < 20) and determine the order in which the applicants are sent off for retraining. Each set of three numbers will be on a separate line and the end of data will be signalled by three zeroes (0 0 0).
Output
For each triplet, output a single line of numbers specifying the order in which people are chosen. Each number should be in a field of 3 characters. For pairs of numbers list the person chosen by the counter-clockwise official first. Separate successive pairs (or singletons) by commas (but there should not be a trailing comma).
Sample input
10 4 3
0 0 0
Sample output
␣␣4␣␣8,␣␣9␣␣5,␣␣3␣␣1,␣␣2␣␣6,␣10,␣␣7
题目大意:n个人逆时针编号,输入n,k,m;由n个数组成的环,每回操作删除逆时针的第k个和顺时针的第m个(同时删除)。
注意:1、相同时只输出一个。
2、三角型代表空格。
3、最后一个输出不带有‘,’。
4丶输出时,每个输出占三个位置,使用%3d输出。
思路:定义i=1,j=n,进行游动比较,符合的记录下来,然后输出。
代码:
#include<iostream>
#include<string.h>
#include<cstdio>
using namespace std;
int a[25];
int main()
{
int n,k,m;
while(scanf("%d%d%d",&n,&k,&m)!=EOF)
{
if(n==0&&m==0&&k==0)
break;
for(int i=1;i<=n;i++)
a[i]=1;
int i=1,j=n;
int ans=0;
while(ans<n)
{
int xi,xj;
int kx=0,mx=0;
while(kx<k)
{
if(a[i]==1)
{
++kx;
// cout<<"kx"<<kx<<endl;
if(kx==k)
{
xi=i;
// cout<<"xi"<<xi<<endl;
}
// cout<<"i"<<i<<endl;
// if(ans==n-1||ans==n-2)
// {
// cout<<"xi"<<xi<<endl;
// cout<<"i"<<i<<endl;
// }
i++;
if(i>n)
i-=n;
}
else if(a[i]==0)
{
i++;
if(i>n)
i-=n;
}
}
while(mx<m)
{
if(a[j]==1)
{
mx++;
if(mx==m)
xj=j;
// if(ans==n-1||ans==n-2)
// cout<<"xj"<<xj<<endl;
j--;
if(j<1)
j+=n;
}
else if(a[j]==0)
{
j--;
if(j<1)
j+=n;
}
}
// cout<<xi<<xj<<endl;
if(xi==xj)
{
a[xi]=0;
printf("%3d",xi);
ans++;
if(ans<n)
cout<<",";
// cout<<a[xi]<<endl;
continue;
}
a[xi]=0,a[xj]=0;
printf("%3d%3d",xi,xj);
ans=ans+2;
if(ans<n)
cout<<",";
// cout<<a[xi]<<a[xj]<<endl;
}
cout<<endl;
}
return 0;
}