Crashing Balloon

原创 2006年06月04日 20:47:00
Crashing Balloon

Time limit: 1 Seconds   Memory limit: 32768K  
Total Submit: 3758   Accepted Submit: 993  

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

My Solution

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>

using namespace std;

void generateAllProducts(int n, vector< vector<int> > &coll) {
  int start = 2;
  vector<int> stack;
 
  while (1) {
    int sq = (int) sqrt(n * 1.0);
    int max = (sq > 100) ? 100 : sq;
    int i;
   
    for (i = start; i <= max; ++i) {
      if (n % i == 0) {
        n /= i;
        stack.push_back(i);
        max = (sq > 100) ? 100 : sq;
      }
    }
  
    if (i > max && n <= 100 && (stack.size() == 0 || n > stack[stack.size()-1])) { 
      stack.push_back(n);
      coll.push_back(stack);
    } else {
      stack.push_back(n);
    }
   
    int stSize = stack.size();
    if (stSize == 1) {
      break;
    }
   
    int div1 = stack[stSize - 1];
    int div2 = stack[stSize - 2];
   
    n = div1 * div2;
    start = div2 + 1;
    stack.pop_back();
    stack.pop_back();
  } 
 
}

// require sorted v1, v2 by asc
bool hasSameElement(const vector<int> &v1, const vector<int> &v2) {
  unsigned int i = 0, j = 0; 
 
  while (i < v1.size() && j < v2.size()) {
    if (v1[i] == v2[j]) {
      return true;
    } else if (v1[i] > v2[j]) {
      ++j;
    } else {
      ++i;
    }
  }
 
  return false;
}

bool challenge(int a, int b) {
  vector< vector<int> > coll_a, coll_b;
 
  generateAllProducts(a, coll_a); 
  generateAllProducts(b, coll_b);
 
  if (coll_b.size() == 0) {
    return false;
  }
 
  vector< vector<int> >::iterator iter1, iter2;
  for (iter1 = coll_a.begin(); iter1 != coll_a.end(); ++iter1) {
    const vector<int>& e1 = *iter1;
    for (iter2 = coll_b.begin(); iter2 != coll_b.end(); ++iter2) {
      const vector<int>& e2 = *iter2;
      if (!hasSameElement(e1, e2)) {
        // challenge failed
        return false;
      }
    }
  } 
 
  coll_a.clear();
  coll_b.clear();
 
  return true; 
}

int main() {
  int a, b;
 
  while (cin >> a >> b) {
    if (a < b) {
      a = a + b;
      b = a - b;
      a = a - b;
    }
   
    if (challenge(a, b)) {
      cout << b << endl;
    } else {
      cout << a << endl;
    }
  }
 
}

======================================
Problem Source: Zhejiang University Local Contest 2001

kvm的气泡(balloon)机制 及 在线资源调整

最近想借用kvm虚拟化中的balloon机制来实现linux云主机的在线资源伸缩,由于cloudstack也采用balloon技术来在线调整云主机的资源,因此在可行性上应该没有问题,不过在实际测试中碰...
  • weiyuanke
  • weiyuanke
  • 2014年04月15日 21:40
  • 1990

kernel crash 发生后的那些事(四)

Oops信息打印后,后面还有一个 crash dump 和系统重启的过程,本例为系统重启,在UBoot中保存core dump. die-> crash_kexec kernel/kexec....
  • u011279649
  • u011279649
  • 2013年07月08日 18:51
  • 2412

CKEditor的简单使用

  • dotuian
  • dotuian
  • 2013年03月11日 11:16
  • 1537

ZOJ 1003 Crashing Balloon

题目来源:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=3 这是一道模拟题! #include #include #in...
  • Hearthougan
  • Hearthougan
  • 2014年04月02日 15:46
  • 490

zoj1003Crashing Balloon

Crashing Balloon Time Limit: 2 Seconds      Memory Limit: 65536 KB On every June 1st, the Chil...
  • z8110
  • z8110
  • 2015年08月05日 20:14
  • 272

1003 Crashing Balloon

Crashing Balloon Time Limit: 2 Seconds      Memory Limit: 65536 KB On every June 1st, the C...
  • net_assassin
  • net_assassin
  • 2012年09月20日 14:15
  • 702

Crashing Balloon from http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=3

On every June 1st, the Children's Day, there will be a game named "crashing balloon" on TV.   The ru...
  • cstur4
  • cstur4
  • 2012年09月23日 21:46
  • 577

zoj1003 crashing balloon

//内容来自ConwayTian /* blog上一大把,copy,但很多copy的并不是那么好。 */ #include   #include   using namespace std;     ...
  • scylhy
  • scylhy
  • 2015年11月19日 23:10
  • 462

浙大ACM 1003 Crashing Balloon

这题当时一开始想的很简单,然后碰壁了,后来用递归搞定的。现在拿来看看代码 Crashing Balloon Time Limit: 2 Seconds      Memory Limi...
  • u010935715
  • u010935715
  • 2014年03月04日 12:16
  • 826

ZOJ--1003:Crashing_Balloon(因子分解)

On every June 1st, the Children's Day, there will be a game named "crashing balloon" on TV.   The ru...
  • yf224
  • yf224
  • 2017年06月05日 21:06
  • 157
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Crashing Balloon
举报原因:
原因补充:

(最多只允许输入30个字)