救济金发放(The Dole Queue,UVa33)
来源:互联网 发布:网络身份认证系统 编辑:程序博客网 时间:2024/05/21 17:45
The Dole Queue
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 counter-clockwise 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 counter-clockwise official first. Separate successive pairs (or singletons) by commas (but there should not be a trailing comma).
Sample input
10 4 30 0 0
Sample output
4 8, 9 5, 3 1, 2 6, 10, 7
where represents a space.
#include<cstdio>#include<string.h>#include<algorithm>using namespace std;int a[20],n;int go(int b,int c,int d){while(d--){do{b=(b+c+n-1)%n+1; //顺时针走或者逆时针走的关键!!!自己可以演示一下过程。。。 }while(a[b]==0); //走到下一个非0数字,遇到已经走过的数字,继续执行do语句。 }return b; //返回经过d步后所停留的位置。 }int main(){int k,m,t,p1,p2;while(scanf("%d%d%d",&n,&k,&m)&&n){t=n; //t表示剩下的人数 。 p1=n,p2=1;memset(a,0,sizeof(a));for(int i=1;i<=n;i++){a[i]=i;}while(t){p1=go(p1,1,k);printf("%3d",p1);t--;p2=go(p2,-1,m);if(p2!=p1){ printf("%3d",p2); t--; } a[p1]=a[p2]=0; //标记走过的位置 。 if(t) printf(",");}printf("\n");}}
- 救济金发放(The Dole Queue,UVa33)
- 救济金发放The Dole Queue
- UVa 133 The Dole Queue(救济金发放)
- 救济金发放(The Dole Queue, UVa 133)
- 救济金发放 (The Dole QUEUE UVa 133)
- UVA 133 The Dole Queue(救济金发放)
- 救济金发放 (The Dole QUEUE) do while
- uva133救济金发放The Dole Queue
- UVa - 133 - The Dole Queue(救济金发放)
- 救济金发放 (The Dole Queue, UVa 133)
- UVa OJ The Dole Queue 救济金发放 133
- 例题 4-3 救济金发放(The Dole Queue) UVa 133
- 救济金发放The Dole QueueUVA 133
- 救济金发放(uva-133)
- The Dole Queue(UVA 133)
- UVA133 The Dole Queue (模拟)
- uva133 The Dole Queue
- 133 - The Dole Queue
- 【第15周 项目3 - B-树的基本操作】
- 文档链接集合
- 第十五周项目5—插入排序之希尔排序
- 第一次上趣味编程
- 弹出窗体PopupWindow的使用
- 救济金发放(The Dole Queue,UVa33)
- CodeBlocks使用与单步调试
- 交换排序之快速排序(以中间位置的元素作为基准)
- html第一天
- spring学习笔记(2)
- Spring Batch系列总括
- QStandardItemModel 自动被析构的问题
- [Web前端]梳理-DOM.13. window常用子对象
- (第十五周项目1)验证算法