HDOJ---ACMSteps---2.1.4Cake_每行有两个数p和q.-优快云博客

本文链接：https://blog.youkuaiyun.com/chuan6099/article/details/8455045

Cake

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 1469 Accepted Submission(s): 699

Problem Description

一次生日Party可能有p人或者q人参加,现准备有一个大蛋糕.问最少要将蛋糕切成多少块(每块大小不一定相等),才能使p人或者q人出席的任何一种情况,都能平均将蛋糕分食.

Input

每行有两个数p和q.

Output

输出最少要将蛋糕切成多少块.

Sample Input

2 3

Sample Output

4


      
      
       
       
        
        Hint
       
       将蛋糕切成大小分别为1/3,1/3,1/6,1/6的四块即满足要求.
当2个人来时，每人可以吃1/3+1/6=1/2 , 1/2块。
当3个人来时，每人可以吃1/6+1/6=1/3 , 1/3, 1/3块。

#include <iostream>
#include <cstdlib>
#include <cstdio>

using namespace std;

int gcd(int m, int n)
{
   int r;
   if (m < n)
   {
      r = m;
      m = n;
      n = r;
   }
   do
   {
      r = m % n;
      m = n;
      n = r;
   }while(n != 0);

   return m;
}

int main()
{
    int p, q;
    while (scanf("%d%d", &p, &q) != EOF)
    {
       printf("%d\n", (p + q - gcd(p ,q)));
    }

    return 0;
}