UVA133 The Dole Queue

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.

利用数组来储存数据，并用求余(%)操作来循环遍历数组。

假如数组个数为n，下标从0开始储存数据，开始遍历位置下标为start，步长为step,则在此题目中逆时针遍历时下一位置下标为 start=(start+step)%n，顺时针遍历时下一位置下标为 start=(start-step+n)%n，因为离开的人不计算，所以要一步一步的遍历，具体见代码。

#include<stdio.h>
#include<string.h>

int a[20];

int main()
{
	int n, k, m;
	while (scanf("%d%d%d", &n, &k, &m) == 3 && n&&k&&m)
	{
		memset(a, 0, sizeof(a));
		for (int i = 0;i<n;i++)
			a[i] = i + 1;

		int p1 = 0, p2 = n - 1;
		int leavePerson = 0;  //离开的人数
		m--;  //m,k为步长，因为是从当前位置开始数起，所以两个步长均需减一
		k--;
		while (leavePerson != n)
		{
			int tk = k, tm = m;  //保存k,m的值

			while (tk--)
			{
				do {
					p1 = (p1 + 1) % n;
				} while (a[p1] == 0);  //找下一个不为零的位置
			}

			while (tm--)
			{
				do {
					p2 = (p2 - 1 + n) % n;
				} while (a[p2] == 0);  //找下一个不为零的位置
			}


			printf("%3d", a[p1]);
			leavePerson++;
			a[p1] = 0;

			if (p2 != p1)
			{
				printf("%3d", a[p2]);
				leavePerson++;
				a[p2] = 0;
				do {
					p2 = (p2 - 1 + n) % n;
				} while (a[p2] == 0&&leavePerson!=n);
			}
			else
            {
                do {
					p2 = (p2 - 1 + n) % n;
				} while (a[p2] == 0&&leavePerson!=n);
            }
            do {
				p1 = (p1 + 1) % n;
			} while (a[p1] == 0&&leavePerson!=n);
			
			if (leavePerson != n)
				printf(",");
		}
		printf("\n");
	}
	return 0;
}