UVa 133 - The Dole Queue

// File Name: UVa133.cpp
// Author: Toy
// Created Time: 2013年04月01日 星期一 17时46分49秒

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <cctype>
#include <cmath>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <utility>
#include <bitset>
#define L(x) x << 1
#define R(x) x << 1 | 1

using namespace std;

int queue[24], Case, k, m, front, rear, tmp1, tmp2, num;

int main ( ) {
while ( scanf ( "%d%d%d", &Case, &k, &m ) && Case + k + m ) {
for ( int i = 1; i <= Case; ++i )
queue[i] = i;
front = 0;
rear = Case + 1;
num = 1;
while ( num <= Case ) {
tmp1 = tmp2 = 0;
while ( 1 ) {
if ( queue[front] != 0 ) tmp1++;
if ( front > Case ) front = 0;
if ( tmp1 == k ) {
printf ( "%3d", queue[front] );
num++;
break;
}
front++;
}
while ( 1 ) {
if ( queue[rear] != 0 ) tmp2++;
if ( rear < 1 ) rear = Case + 1;
if ( tmp2 == m ) {
if ( queue[front] != queue[rear] ) {
printf ( "%3d", queue[rear] );
num++;
}
break;
}
rear--;
}
queue[front] = 0;
queue[rear] = 0;
if ( num <= Case ) printf ( "," );
}
printf ( "\n" );
}
return 0;
}