放寒假时，做的zoj的题，，现在看看，好多都不知道当时怎么想的了，所以现在开始写报告，不求多，只求每道题，都可以理解透彻；
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
这题的大概题意如下，，几乎看不懂英文啊，百度别人的，惭愧啊！
/*两个人踩一百只气球，气球上分别标号1到100，每个人的得分是他踩坏的气球号码之乘积。
注意一百只气球不一定被全部踩完，但剩下的气球会被拿走而无法验证。现在问题是：
有的人在汇报自己得分时会说谎。我们假定汇报自己得分较低的人没有说谎，那么如果他的得分与另一个人的得分之
间有不可调和的矛盾（例如343和49。343只能分解为7＊49，而49只能有一个四十九号球产生，这样就有矛盾）则我
们判定得分较高者在说谎，较低者获胜，否则的封高者获胜。输入数据为若干组两个得分，输出获胜者的得分。如
果某个得分本身就是不可能存在的，就判另一个人获胜好了*/
这题是属于搜索的题目，
这题使用我是用递归来求解M，N是否分解完，并且如果求解完数小的那个（整除到1），就认为小的没有撒谎，而且还要判断打的是否可以可以整除到1.当可以时，说明是打的赢了，反之就说明在说谎，还要判断小的才可以，所以运用递归来判断。而另一种情况，如果小的那个不可以整除到1，就可以输了；
1669
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
