第六题 UVA133 救济金发放 The Dole Queue

UVA133 救济金发放 The Dole Queue

PDF
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 counterclockwise 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 counterclockwise official first. Separate successive pairs (or singletons) by commas (but there should not be a
trailing comma).
Note: The symbol ⊔ in the Sample Output below represents a space.
Sample Input
10 4 3
0 0 0
Sample Output
␣␣4␣␣8,␣␣9␣␣5,␣␣3␣␣1,␣␣2␣␣6,␣10,␣␣7

#include<cstring>
#include<cstdio> 
#include<iostream>
#define Maxn 25 
using namespace std;
int a[Maxn];
int n,k,m;

inline int cilckadd(int p,int c,int t) { 
	while(t) {
		p += c;
		if(p == n + 1) p = 1;
		if(a[p]) t--; 
	}
	return p;
}
inline int cilcksub(int p,int c,int t) {
	while(t) {
		p += c;
		if(!p) p = n;
		if(a[p]) t--;
	}
	return p;
}


int main() {
	while(scanf("%d%d%d",&n,&k,&m)==3&&n) {
		for(int i=1;i<=n;i++) a[i] = i;
		int left = n,p1=n,p2=1;
		while(left) {
			p1 = cilckadd(p1,1,k);
			p2 = cilcksub(p2,-1,m);
			printf("%3d",p1); left--;
			if(p1!=p2) { printf("%3d",p2); left--; }
			a[p1] = a[p2] = 0;
			if(left) printf(",");
		}
		printf("\n");
	}
	return 0;
}

这个题目是刘汝佳老师 紫书上的一个题    看似简单 对于初学者来说真的是比较锻炼断码实现能力的一个题目
inline int go(int p,int d,int t) {
	while(t--) {
		do{
			p = (p+d+n-1)%n+1;
		}while(a[p]==0);
	}
	return p;
}
这个是刘老师处理“数人”的过程实现函数，看了半天还是有的地方没搞懂
欢迎留言给解释一下 哈哈哈哈
我就比较笨了 写了两个函数..............