Cake |
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) |
Total Submission(s): 1548 Accepted Submission(s): 742 |
Problem Description
一次生日Party可能有p人或者q人参加,现准备有一个大蛋糕.问最少要将蛋糕切成多少块(每块大小不一定相等),才能使p人或者q人出席的任何一种情况,都能平均将蛋糕分食.
|
Input
每行有两个数p和q.
|
Output
输出最少要将蛋糕切成多少块. |
Sample Input
2 3 |
Sample Output
4 |
题解:重合的部分就是两个数的公约数 公式a+b-gcd(a,b)
code:
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<stdio.h>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cstring>
using namespace std;//头文件
int gcd(int x,int y)
{
while(x!=y)
{
if(x>y)x=x-y;
else
y=y-x;
}
return x;
}
int main()
{
int a,b;
while(cin>>a>>b)
{
cout<<a+b-gcd(a,b)<<endl;
}
return 0;
}