Crashing Balloon from http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=3
2012-09-23 21:46
525 查看
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.
[/code]
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
参考了网上的代码
#include<iostream> #include<cstdio> #include<memory.h> #include<cstdlib> using namespace std; int siga, sigb; void dfs(int a, int b, int x){ if(b==1){ sigb = b; if(a==1){ siga = a; } } if(x==1 || a==1 && b==1){ return; } if(b%x==0) dfs(a, b/x, x-1); if(a%x==0) dfs(a/x, b, x-1); dfs(a, b, x-1); } int main() { //freopen("in.txt", "r", stdin); int a, b, tmp; while(cin>>a>>b){ if(a<b){ tmp = a; a = b; b = tmp; } siga = sigb = 0; dfs(a, b, 100); if(siga==1) cout<<a<<endl; else if(sigb==1){ cout<<b<<endl; }else{ cout<<a<<endl; } } //fclose(stdin); return 0; }
[/code]
相关文章推荐
- Fire Net from http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=2
- 三塔DP——http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3554
- zoj1789http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=789
- 记录ZOJ(http://acm.zju.edu.cn/onlinejudge/)上的Python之旅
- http://acm.pku.edu.cn/JudgeOnline/problem?id=2480 欧拉
- http://acm.pku.edu.cn/JudgeOnline/problem?id=1284 (原根)
- http://acm.pku.edu.cn/JudgeOnline/problem?id=3667 区间更新+求满足长短的最左区间
- http://acm.pku.edu.cn/JudgeOnline/problem?id=2407 很水的欧拉
- http://acm.pku.edu.cn/JudgeOnline/problem?id=1131 八进小数转十进制小数
- http://acm.pku.edu.cn/JudgeOnline/problem?id=2891 欧几里德线性同余方程
- http://acm.pku.edu.cn/JudgeOnline/problem?id=2305 大数的b进制数 取模
- http://acm.pku.edu.cn/JudgeOnline/problem?id=2528 成段更新,区间统计颜色的种类(离散化处理线段)
- http://acm.tzc.edu.cn/acmhome/problemdetail.do?&method=showdetail&id=1072
- http://acm.hunnu.edu.cn/online/?action=problem&type=show&id=10594&courseid=4
- http://acm.pku.edu.cn/JudgeOnline/problem?id=2409 polya或者burnside
- http://acm.hunnu.edu.cn/online/?action=problem&type=show&id=10102&courseid=0
- http://acm.pku.edu.cn/JudgeOnline/problem?id=3468 成段更新,区间求和(要用long long)
- http://acm.pku.edu.cn/JudgeOnline/problem?id=2777 成段更新,区间统计颜色的种类 (用的位运算, 可是写的很搓)
- http://acm.pku.edu.cn/JudgeOnline/problem?id=1808 二次剩余式
- Problem 1453 Bignum Arithmetic from http://acm.fzu.edu.cn/problem.php?pid=1453