http://acm.hust.edu.cn/vjudge/contest/123676#problem/C 密码5201
Description
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
where represents a space.
#include<stdio.h>
#include<string.h>
int s[25];
int n,k,m;
int go(int a,int t,int no)
{
while(no--)
{
do
{
a+=t;
if(a>=n) a=0;
if(a<0) a=n-1;
}while(s[a]);
}
return a;
}
int main()
{
//freopen("C:\\Users\\5201\\Desktop\\1.txt","r",stdin);
while(scanf("%d%d%d",&n,&k,&m))
{
if(n==0&&k==0&&m==0) break;
memset(s,0,sizeof(s));
int a=-1,b=n,tn=n;
while(tn)
{
a=go(a,1,k);
b=go(b,-1,m);
s[a]=1;s[b]=1;
if(a==b)
{
if(tn!=n) printf(",");
printf(" %d",a+1);
tn--;
}
else
{
if(tn!=n) printf(",");
printf("%3d%3d",a+1,b+1);
tn-=2;
}
}
printf("\n");
}
return 0;
}
ps
1.约瑟夫环问题。
2.注意输出格式。