Crashing Balloon
Time Limit: 2 Seconds Memory Limit: 65536 KB
On every June 1st, the Children's Day, there will be a game named "crashing balloon" on TV. The rule is very simple. On the ground there are 100 labeled balloons, with the numbers 1 to 100. After the referee shouts "Let's go!" the two players, who each starts
with a score of "1", race to crash the balloons by their feet and, at the same time, multiply their scores by the numbers written on the balloons they crash. After a minute, the little audiences are allowed to take the remaining balloons away, and each contestant
reports his\her score, the product of the numbers on the balloons he\she's crashed. The unofficial winner is the player who announced the highest score.
Inevitably, though, disputes arise, and so the official winner is not determined until the disputes are resolved. The player who claims the lower score is entitled to challenge his\her opponent's score. The player with the lower score is presumed to have told
the truth, because if he\she were to lie about his\her score, he\she would surely come up with a bigger better lie. The challenge is upheld if the player with the higher score has a score that cannot be achieved with balloons not crashed by the challenging
player. So, if the challenge is successful, the player claiming the lower score wins.
So, for example, if one player claims 343 points and the other claims 49, then clearly the first player is lying; the only way to score 343 is by crashing balloons labeled 7 and 49, and the only way to score 49 is by crashing a balloon labeled 49. Since each
of two scores requires crashing the balloon labeled 49, the one claiming 343 points is presumed to be lying.
On the other hand, if one player claims 162 points and the other claims 81, it is possible for both to be telling the truth (e.g. one crashes balloons 2, 3 and 27, while the other crashes balloon 81), so the challenge would not be upheld.
By the way, if the challenger made a mistake on calculating his/her score, then the challenge would not be upheld. For example, if one player claims 10001 points and the other claims 10003, then clearly none of them are telling the truth. In this case, the
challenge would not be upheld.
Unfortunately, anyone who is willing to referee a game of crashing balloon is likely to get over-excited in the hot atmosphere that he\she could not reasonably be expected to perform the intricate calculations that refereeing requires. Hence the need for you,
sober programmer, to provide a software solution.
Input
Pairs of unequal, positive numbers, with each pair on a single line, that are claimed scores from a game of crashing balloon.
Output
Numbers, one to a line, that are the winning scores, assuming that the player with the lower score always challenges the outcome.
Sample Input
343 49
3599 610
62 36
Sample Output
49
610
62
Source
ZOJ1003
这道题的难点在于两位选手都可能有多个不同的分解方案,只要其中任何一种分解方案不冲突即是被挑战者赢。
这道题寒假刚开始做ACM的时候做过但没做出来,百度了别人的思路,代码如下:
因为实验又做到这一题,因此重新翻出以前的代码看了一下,发现有很多重复冗余的地方,于是重新找了一个思路:
=======================签 名 档=======================
原文地址(我的博客):http://lanfei.sinaapp.com/2012/05/1127.html
欢迎访问交流,至于我为什么要多弄一个博客,因为我热爱前端,热爱网页,我更希望有一个更加自由、真正属于我自己的小站,或许并不是那么有名气,但至少能够让我为了它而加倍努力。。
=======================签 名 档=======================
分享到:
相关推荐
这是一份ZOJ的ACM题解,包含大多数题目的AC程序,是学习算法的好东西~
最近在acm.zju.edu.cn上通过的题目的代码,都是比较有价值的题目
浙大acm OJ1204,自己做的,已经AC 分享一下,若有更好的算法可以教教我
ACM_算法模板集史上最完整收藏版223页全免费版.pd
浙江大学ZOJ源码题解,按照题目类型和难易分类。
杭电hdu acm资料所用杭电的acm题
acm中zoj1002的可运行C++程序
noi试题和解析,对于参加acm非常有帮助
浙江大学ACM题解JU_ACM_All_Anwer,里面一本非常好的chm电子书,浙大的所有ACM题及题解都在了,对学习ACM的朋友非常的好~还等什么呢?
ACM__ICPC__重要补充知识.doc
Pascal acm_timus_ural_1148.pas
Pascal acm_timus_ural_1099.pas
ACM_基础篇
ACM,竞赛题目,我已经在上面测试过了,可以用,题目是ARGUS,希望大家可以喜欢,花了长时间才弄好的
ACM_竞赛试题,对于那些参加各种比赛,特别是ACM大赛的人会有很大帮助
ACM的重要PPT资料,对初学者非常有益处
一些关于ACM算法的资料,包括5种算法的详细讲解和ACM题型分类以及一些基础题目
杭电 hdu acm 第1084题的解法,ac过了,是一位学长教我的.内有一些中文说明.
ACM_String.
ACM_贪心.