uva 133（模拟）

 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. 

题目意思是输入3个数n，a，b,表示有n个人顺时针围成一圈，第一个人起顺时针隔a个去掉一个，第n个人起逆时针隔b个去掉一个，输出每次去掉的人的原始编号；

模拟题。自行想办法模拟，也可参考我代码：（这题最坑的是输出的空格，不是输出空格而是占3个位置）

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
     int n,a,b;
     while(cin>>n>>a>>b&&!(a==0&&b==0))
     {
        int x[n+1];
        for(int i=1;i<=n;i++)
            x[i]=i;
        int l=0,r=n+1;
        while(1)
        {
            int flag=0,s=0;
            for(int i=1;i<=n;i++)
                if(x[i]!=0)
            {
                s++;
                flag=1;
            }//cout<<s<<endl;
            if(flag==0)
                break;
            int a0=a,b0=b;
            while(a0>0)
            {
                if(l==n)
                    l=1;
                else l++;
            if(x[l]!=0)
                a0--;
               // cout<<l<<' '<<x[l]<<endl;
            }
            while(b0>0)
            {

               // cout<<r<<endl;
                if(r==1)
                    r=n;
                else r--;
                 if(x[r]!=0)
                b0--;
            }
            if(r==l&&s!=1)
            {
                printf("%3d",x[r]);
                cout<<',';
            }
            else if(r==l&&s==1)
            {
                printf("%3d",x[r]);
                cout<<endl;;
            }
        else if(r!=l&&s!=2)
            {
                printf("%3d%3d",x[l],x[r]);
                cout<<',';
            }
            else if(r!=l&&s==2)
            {
                printf("%3d%3d",x[l],x[r]);
                 cout<<endl;
            }
            x[r]=0;x[l]=0;
        }
     }
    return 0;
}