UVa133 - The Dole Queue
2017-04-03 09:32
387 查看
//UVa133 - The Dole Queue //Time out #include<cstdio> #define maxn 25 using namespace std; int n, k, m, a[maxn]; //p为初位置,逆时针走t步,d为-1时顺时针走,返回新位置 int go(int p, int d, int t){ while(t--){ do{ p = (p+d+n-1)%n+1; }while(a[p] == 0); } 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; int x = n, y = 1; while(left--){ x = go(x, 1, k); y = go(y, -1, m); printf("%3d", x); left--; if(y != x){ printf("%3d", y); left--;} a[x] = a[y] = 0; if(left) printf(","); } printf("\n"); } return 0; }
相关文章推荐
- uva133 The Dole Queue 循环队列模拟
- uva 133 - The Dole Queue
- UVA【133】 The Dole Queue
- UVA 133 The Dole Queue
- UVA - 133 The Dole Queue
- UVa 133 - The Dole Queue
- UVa 133 - The Dole Queue
- UVa133 The Dole Queue
- Uva 133 - The Dole Queue
- uva-133 - The Dole Queue
- UVA - 133 The Dole Queue(模拟链表)
- uva 133 - The Dole Queue
- uva-133 The Dole Queue
- UVa 133 - The Dole Queue 数据结构专题
- 紫书章四例题3——UVA 133 TheDole Queue
- UVA-133 The Dole Queue
- Uva 133 - The Dole Queue
- UVA - 133 The Dole Queue
- 救济金发放(The Dole Queue, UVa 133)
- 救济金发放 (The Dole QUEUE UVa 133)