编程竞赛2011年国际大学生程序设计竞赛中西部区域赛题目解析与算法设计资源-CSDN下载

175 浏览量 2025-07-10 21:12:45 上传评论收藏 448KB PDF 举报

资源推荐

资源详情

资源评论

ACM International Collegiate Programming Contest

2011 East Central Regional Contest

Grand Valley State University

University of Cincinnati

University of Windsor

Youngstown State University

October 22, 2011

Sponsored by IBM

Rules:

1. There are nine problems to be completed in ﬁve hours.

2. All questions require you to read the test data from standard input and write results to standard

output. You cannot use ﬁles for input or output. Additional input and output speciﬁcations can

be found in the General Information Sheet.

3. No whitespace should appear in the output except between printed ﬁelds .

4. All whitespace, either in input or output, will consist of exactly one blank character.

5. The allowed programming languages are C, C++ and Java.

6. All programs will be re-compiled prior to testing with the judges’ data.

7. Non-standard libraries cannot be used in your solutions. The Standard Template Library (STL)

and C++ string libraries are allowed. The standard Java API is available, except for those

packages that are deemed dangerous by contestant oﬃcials (e.g., that might generate a security

violation).

8. The input to all problems will consist of multiple test cases.

9. Programming style is not considered in this contest. You are free to code in whatever style you

prefer. Documentation is not required.

10. All communication with the judges will be handled by the PC

environment.

11. Judges’ decisions are to be considered ﬁnal. No cheating will be tolerated.

2011 East Central Regional C ontest 2

Problem B: Chain of Fools

Many of you have heard the story of Turing’s bicycle: Seems the sprocket on the crank of the bicycle

had a broken prong. Also his chain had one link that was bent. When the bent link on the chain came

to hook up with the broken prong, the chain would fall oﬀ and Turing would stop and put the chain

back on. But Turing, being who he was, could predict just when this was going to happen — meaning

he would know how many pedal strokes it would be — and so would hop oﬀ his bike just before it

happened and gently move the pedals by hand as the undesired coupling passed. Then he’d be merrily

(we imagine) on his way. (A picture of the sprocket-chain set up is shown below.)

Your job here is to calculate the number of revolutions required in such a situation as Turing’s: You’ll

be given the number of prongs on the front sprocket, the number of links on the chain, the location of

the broken prong and the location of the bent link in the chain. The top prong is at location 0, then

the next one forward on the sprocket is location 1 and so on until prong numbered s − 1. (See the

diagram. Notice that prong s − 1 is the next prong that moves to the top of the sprocket as Turing

pedals.) Location of the links is similar: The link at the top of the sprocket is location 0 and so on

forward until c − 1. The chain falls oﬀ when broken prong and bent link are both at location 0.

Input

Input for each test case will be one line of the form s c p l, where s is the number of prongs on the front

sprocket (1 < s < 100) , c is the number of links in the chain (200 > c > s), p is the initial position of

the broken prong, and l is the initial position of the bent link. The line 0 0 0 0 will follow the last line

of input.

Broken prong and bent link will never both start at position 0.

Output

For each test case output a single one line as follows:

Case n: r m/s

if it requires r m/s revolutions to ﬁrst fail, or

Case n: Never

if this can never happen.

Note that the denominator of the fraction will always be the number of prongs on the sprocket; the

fraction will not necessarily be in lowest terms. Always print the values of r and m, even if 0.

剩余12页未读，继续阅读

评论收藏

内容反馈

ModelBulider

粉丝: 5138

编程竞赛2011年国际大学生程序设计竞赛中西部区域赛题目解析与算法设计

ACM国际大学生程序设计竞赛：题目与解读(part1和part2完整版高清源版)

第46届ICPC国际大学生程序设计竞赛亚洲区预赛 上海站 正式赛题目

ACM国际大学生程序设计竞赛：算法与实现 俞勇

ACM国际大学生程序设计竞赛：算法与实现俞勇PDF完整版

ACM国际大学生程序设计竞赛：题目与解读.part2

ACM国际大学生程序设计竞赛：题目与解读.part1

第二届全国大学生算法设计与编程挑战赛(春季赛 赛题).rar

2011年全国大学生电子设计竞赛题目_含综合测评题

ACM国际大学生程序设计竞赛：算法与实现

ACM国际大学生程序设计竞赛：知识与入门(完整高清版带书签)

ACM 国际大学生程序设计竞赛试题与解析 PDG

国际大学生程序设计竞赛例题解．三：图论、动态规划算法、综合题专集

国际大学生程序设计竞赛中山大学内部选拔真题解（一）光盘

国际大学生程序设计竞赛例题解 [合集八本1-8]

国际大学生程序设计竞赛例题解 广东省大学生程序设计竞赛试题

算法参考资料国际大学生程序设计竞赛例题解2广东省大学生程序设计竞赛试题2003-2005年

2011年全国大学生电子设计大赛本科组的竞赛题目及相关作品

ACM国际大学生程序设计大赛珠海区域赛题目

计算机科学_算法与编程竞赛_ACM国际大学生程序设计竞赛模板库_XeLaTeX排版与Python语法高亮_面向算法竞赛选手的完整代码模板集合与快速生成PDF工具_包含多种编程语言的.zip

ACM 国际大学生程序设计竞赛试题与解析

北京大学acm国际大学生程序设计竞赛课件

acm国际大学生程序设计竞赛培训计划 PDF

ACM国际大学生程序设计竞赛：知识与入门

第二届吉林省大学生程序设计竞赛

acm.rar_ACM_ACM PDF_ACM 程序设计_ACM国际大学生程序设计竞赛试题与解析_acm国际大学生程序设计竞赛

css样式文字图片在浏览器中不能拖拽(不能选中，不能复制)

基于plc的电梯控制系统的设计(修改版)毕业论文初稿(1)(1).doc

最新资源

第46届ICPC国际大学生程序设计竞赛亚洲区预赛上海站正式赛题目

ACM国际大学生程序设计竞赛：算法与实现俞勇

第二届全国大学生算法设计与编程挑战赛(春季赛赛题).rar

国际大学生程序设计竞赛例题解广东省大学生程序设计竞赛试题