题目如下:
The Dole Queue
The Dole Queue |
In a serious attempt to downsize (reduce) the dole queue, The NewNational Green Labour Rhinoceros Party has decided on the followingstrategy. Every day all dole applicants will be placed in a largecircle, facing inwards. Someone is arbitrarily chosen as number 1,and the rest are numbered counter-clockwise up to N (who will bestanding on 1's left). Starting from 1 and moving counter-clockwise,one labour official counts off k applicants, while another officialstarts from N and moves clockwise, counting m applicants. The two whoare chosen are then sent off for retraining; if both officials pickthe same person she (he) is sent off to become a politician. Eachofficial then starts counting again at the next available person andthe process continues until no-one is left. Note that the two victims(sorry, trainees) leave the ring simultaneously, so it is possible forone official to count a person already selected by the other official.
Input
Write a program that will successively read in (in that order) thethree numbers (N, k and m; k, m > 0, 0 < N < 20) and determinethe order in which the applicants are sent off for retraining. Eachset of three numbers will be on a separate line and the end of datawill be signalled by three zeroes (0 0 0).
Output
For each triplet, output a single line of numbers specifying the orderin which people are chosen. Each number should be in a field of 3characters. For pairs of numbers list the person chosen by thecounter-clockwise official first. Separate successive pairs (orsingletons) 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
where represents a space.
简单的模拟题,一遍AC,一群人站成一圈,每次选出一定编号的人,直到没人为止,输出选出的人的顺序,直接模拟即可。
AC的代码如下:
#include
int main()
{
int n,k,m;
while(scanf("%d%d%d",&n,&k,&m)!=EOF)
{
int i,j,r=0,h=n-1,t=0,ans[50],cir[30],Count=0,num=n;;
if(n==0)
break;
else
{
for(i=0; i<=n-1; i++)
cir[i]=i+1;
while(num)
{
for(i=r; i<=n-1;)
{
if(cir[i]!=0)
Count++;
if(Count==k)
{
r=i;
Count=0;
break;
}
i=(i+1)%n;
}
for(j=h; j>=0;)
{
if(cir[j]!=0)
Count++;
if(Count==m)
{
h=j;
Count=0;
break;
}
if(j>0)
j--;
else
j=n-1;
}
ans[t++]=cir[r];
if(cir[i]!=cir[h])
{
ans[t++]=cir[h];
cir[r]=cir[h]=0;
num=num-2;
if(num!=0)
ans[t++]=0;
}
else
{
cir[i]=cir[h]=0;
num--;
if(num!=0)
ans[t++]=0;
}
}
for(int i=0; i<=t-1; i++)
{
if(ans[i]==0)
printf(",");
else
printf("%3d",ans[i]);
}
printf("\n");
}
}
return 0;
}