ZJU1003-Crashing Ballon
来源:互联网 发布:淘宝卖家关闭交易 编辑:程序博客网 时间:2024/05/21 10:31
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
Output
Sample Input
343 493599 61062 36
Sample Output
4961062
#include <iostream>#include <iomanip>using namespace std;bool atrue, btrue;int judge(int m, int n, int p){ if(atrue) return 0; if(m == 1 && n == 1){ atrue = true; return 0; } if(n == 1) btrue=true; while(p > 1){ if(!(m%p)) judge (m/p, n, p-1); if(!(n%p)) judge (m, n/p, p-1); p--; } return 0;}int main(){ int a,b,temp,i,j; while(cin>>a>>b){ if(a < b){ temp = a; a = b; b = temp; } atrue = false; btrue = false; judge (a, b, 100); if(!atrue && btrue){ cout<<b<<endl; } else cout<<a<<endl; } return 0;}
问题如下1.忽略当n被整除最后结果为1而m不是1的情况,说明大数只有一种方法得到,故b正确2.atrue=true 要返回3.先初始化再判断4.锁定a是大数
- ZJU1003-Crashing Ballon
- ZJU 1003Crashing Ballon
- ZOJ 1003 Crashing Ballon
- ZJU1003 Crashing Balloon - 踩气球
- zju1003
- zju1003
- 浙大ZOJ 1003 Crashing Ballon问题解决及其他人的做法
- Let The Ballon Raise
- hdu 1170(Ballon Comes!)
- hdoj 1170 ballon Comes!(水)
- Crashing Balloon
- Crashing Balloon
- Crashing Balloon
- Crashing Robots
- Crashing Robots
- Crashing Robots
- Crashing Balloon
- Crashing Robots
- leetcode之Valid Palindrome
- 1330 - City Game
- Java中Runnable和Thread的区别
- 《从零开始学Swift》学习笔记(Day 64)——Cocoa Touch设计模式及应用之目标与动作
- 借助短信平台实现手机注册页面的验证吗发送检验功能
- ZJU1003-Crashing Ballon
- apache kafka源代码工程环境搭建(IDEA)
- Velocity使用总结
- 树状数组(2)
- Python爬虫实战六之抓取爱问知识人问题并保存至数据库
- nginx+tomcat实现负载均衡
- 299. Bulls and Cows ——猜数字游戏
- Android Studio安装:Unable to access Android SDK add-on list
- nodejs 项目编译