uva The Dole Queue
2014-05-07 14:08
387 查看
题目如下:
In a serious attempt to downsize (reduce) the dole queue, The NewNational Green Labour Rhinoceros Party has decided on the followingstrategy. Every day all dole applicants will be placed in a largecircle, facing inwards. Someone is arbitrarily chosen as
number 1,and the rest are numbered counter-clockwise up to N (who will bestanding on 1's left). Starting from 1 and moving counter-clockwise,one labour official counts off k applicants, while another officialstarts from N and moves clockwise, counting m applicants.
The two whoare chosen are then sent off for retraining; if both officials pickthe same person she (he) is sent off to become a politician. Eachofficial then starts counting again at the next available person andthe process continues until no-one is left. Note
that the two victims(sorry, trainees) leave the ring simultaneously, so it is possible forone official to count a person already selected by the other official.
of datawill be signalled by three zeroes (0 0 0).
(orsingletons) by commas (but there should not be a trailing comma).
![](http://uva.onlinejudge.org/external/1/133img1.gif)
4
![](http://uva.onlinejudge.org/external/1/133img1.gif)
8,
![](http://uva.onlinejudge.org/external/1/133img1.gif)
9
![](http://uva.onlinejudge.org/external/1/133img1.gif)
5,
![](http://uva.onlinejudge.org/external/1/133img1.gif)
3
![](http://uva.onlinejudge.org/external/1/133img1.gif)
1,
![](http://uva.onlinejudge.org/external/1/133img1.gif)
2
![](http://uva.onlinejudge.org/external/1/133img1.gif)
6,
![](http://uva.onlinejudge.org/external/1/133img2.gif)
10,
![](http://uva.onlinejudge.org/external/1/133img1.gif)
7
where
![](http://uva.onlinejudge.org/external/1/133img2.gif)
represents a space.
简单的模拟题,一遍AC,一群人站成一圈,每次选出一定编号的人,直到没人为止,输出选出的人的顺序,直接模拟即可。
AC的代码如下:
The Dole Queue |
number 1,and the rest are numbered counter-clockwise up to N (who will bestanding on 1's left). Starting from 1 and moving counter-clockwise,one labour official counts off k applicants, while another officialstarts from N and moves clockwise, counting m applicants.
The two whoare chosen are then sent off for retraining; if both officials pickthe same person she (he) is sent off to become a politician. Eachofficial then starts counting again at the next available person andthe process continues until no-one is left. Note
that the two victims(sorry, trainees) leave the ring simultaneously, so it is possible forone official to count a person already selected by the other official.
Input
Write a program that will successively read in (in that order) thethree numbers (N, k and m; k, m > 0, 0 < N < 20) and determinethe order in which the applicants are sent off for retraining. Eachset of three numbers will be on a separate line and the endof datawill be signalled by three zeroes (0 0 0).
Output
For each triplet, output a single line of numbers specifying the orderin which people are chosen. Each number should be in a field of 3characters. For pairs of numbers list the person chosen by thecounter-clockwise official first. Separate successive pairs(orsingletons) by commas (but there should not be a trailing comma).
Sample input
10 4 3 0 0 0
Sample output
![](http://uva.onlinejudge.org/external/1/133img1.gif)
4
![](http://uva.onlinejudge.org/external/1/133img1.gif)
8,
![](http://uva.onlinejudge.org/external/1/133img1.gif)
9
![](http://uva.onlinejudge.org/external/1/133img1.gif)
5,
![](http://uva.onlinejudge.org/external/1/133img1.gif)
3
![](http://uva.onlinejudge.org/external/1/133img1.gif)
1,
![](http://uva.onlinejudge.org/external/1/133img1.gif)
2
![](http://uva.onlinejudge.org/external/1/133img1.gif)
6,
![](http://uva.onlinejudge.org/external/1/133img2.gif)
10,
![](http://uva.onlinejudge.org/external/1/133img1.gif)
7
where
![](http://uva.onlinejudge.org/external/1/133img2.gif)
represents a space.
简单的模拟题,一遍AC,一群人站成一圈,每次选出一定编号的人,直到没人为止,输出选出的人的顺序,直接模拟即可。
AC的代码如下:
相关文章推荐
- UI设计大全汇聚国内外最棒的设计网站
- 1Z0-051 QUESTION 8 子查询和JION的用法
- ContentValues和HashTable和HashMap
- <nine-patch> requires a valid 9-patch source image
- Java反编译工具 JD-GUI
- 1Z0-051 QUESTION 7 ON和USING的用法
- Citrix Synergy 2014 Day 1,Citrix Workspace Suite正式发布
- NGUI自适应屏幕
- UEditor上传图片等附件都出现红叉
- 【翻译】动态图像监测开源代码 motion 学习-----Motion Guide - Installation(motion的安装指南)
- 【翻译】动态图像监测开源代码 motion 学习-----Motion Guide - Installation(motion的安装指南)
- UIToolbar自定义背景及按钮设置
- ui效果图收集
- UITabBar实现自定义背景及UITabBarItem自定义图片和字体
- 1Z0-051 QUESTION 6 CASE和DECODE用法
- C# WebRequestExtensions
- SoapUI调用Web服务
- Java中序列化的serialVersionUID作用
- Quercus-基于 Java 的 PHP 框架
- requireJS(二)