UVA133-TheDoleQueue.zip_site:www.pudn.com_uva133

#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <iomanip> using namespace std; int main() { int n, k, m, p, q, s1, s2; while(cin >> n >> k >> m) { if(n == 0 && k == 0 && m == 0) break; int queue[20]; memset(queue, 0, sizeof(queue)); for(int i = 0; i < n; i++) queue[i] = 1; int count = n, f1 = -1 , f2 = n ; while(count) { p = k % count? k % count : count; q = m % count? m % count : count; while(p--) { do { f1 = (f1 + 1) % n; }while(!queue[f1]); } s1 = f1, count--; while(q--) { do { f2 = (f2 - 1 + n) % n; }while(!queue[f2]); } s2 = f2, queue[f1] = 0, queue[f2] = 0; if(s1 != s2) { count--; cout << setw(3) << s1 + 1 << setw(3)<< s2 + 1 ; } else { cout << setw(3) << s1 + 1 ; } if(count) cout << ","; else cout << endl; } } return 0; }