uva133 The Dole Queue 循环队列模拟

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <algorithm>
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
using namespace std;
typedef long long int LL;
const int MAXN =  0x7fffffff;
const int  MINN =  -0x7fffffff;
const double eps = 1e-9;
const int dir[8][2] = {{0,1},{1,0},{0,-1},{-1,0},{-1,1},
{1,1},{1,-1},{-1,-1}};

int main(void){
#ifndef ONLINE_JUDGE
freopen("uva133.in", "r", stdin);
#endif
int n, k, m, i, j, pos, pos1, cnt, f[30], tmp;
map<int, bool> mymap;
while (~scanf("%d%d%d", &n, &k, &m)) {
if (n+k+m==0) break;
memset(f, 0, sizeof(f));
for (i = 1; i <= n; ++i) f[i] = i;
pos = 0; pos1 = n + 1; cnt = 0;
while (cnt < n) {
tmp = 0;
while (1) {
if (f[pos] != 0) tmp++;
if (pos > n) pos = 0;
if (tmp == k) {
printf("%3d", f[pos]);
cnt++; break;
}
pos++;
}
tmp = 0;
while (1) {
if (f[pos1] != 0) tmp++;
if (pos1 <= 0) pos1 = n + 1;
if (tmp == m) {
if (f[pos] != f[pos1]) {
printf("%3d", f[pos1]);
cnt++;
}
break;
}
pos1--;
}
f[pos] = f[pos1] = 0;
if (cnt < n) printf(",");
}
printf("\n");
}

return 0;
}