hdu acmsteps 2.1.3 Cake

Cake

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

Total Submission(s): 1815 Accepted Submission(s): 862

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块。 

Author

LL

Source

HZIEE 2007 Programming Contest

   1:  #include<iostream>

   2:  using namespace std;

   3:  int gcd(int a,int b){

   4:      return b==0? a:gcd(b,a%b);

   5:  }

   6:  int main(){

   7:      for(int a,b;cin>>a>>b;){

   8:          cout<<a+b-gcd(a,b)<<"\n";

   9:      }

  10:  }

.csharpcode, .csharpcode pre
{
font-size: small;
color: black;
font-family: consolas, "Courier New", courier, monospace;
background-color: #ffffff;
/*white-space: pre;*/
}
.csharpcode pre { margin: 0em; }
.csharpcode .rem { color: #008000; }
.csharpcode .kwrd { color: #0000ff; }
.csharpcode .str { color: #006080; }
.csharpcode .op { color: #0000c0; }
.csharpcode .preproc { color: #cc6633; }
.csharpcode .asp { background-color: #ffff00; }
.csharpcode .html { color: #800000; }
.csharpcode .attr { color: #ff0000; }
.csharpcode .alt
{
background-color: #f4f4f4;
width: 100%;
margin: 0em;
}
.csharpcode .lnum { color: #606060; }

其实可以转换成 一个矩形分同时切成p份或是q份会有多少条线。其中必有gcd(p,q)条线重合。即公式为 p + q - gcd(p,q);