#include<stdio.h>
#include<algorithm>
#include<queue>
#include<string.h>
#include<ctype.h>
#include<set>
#include<math.h>
using namespace std;
int gcd(int a, int b)
{
if (b<a)
{
int temp = a;
a = b;
b = temp;
}
while (b != 0)
{
int temp = a%b;
a = b;
b = temp;
}
return a;
}
int main()
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
int temp = a*b / gcd(a, b);
int temp2 = temp*c / gcd(temp, c);
printf("%d\n", temp2);
}
核桃的数量
最新推荐文章于 2018-11-06 10:57:03 发布