1065. 最小公倍数

12 18

36

 1 #include<cstdio>
 2 #define ll long long
 3 using namespace std;
 4 long long int a,b;
 5 long long int f(long long int a,long long int b)
 6 {
 7     return (a%b==0)?b:f(b,a%b);
 8 }
 9 int main()
10 {
11     scanf("%lld%lld",&a,&b);
12     ll int gcd=f(a,b);
13     ll int ans=(a*b)/gcd;
14     printf("%lld",ans);
15     return 0;
16 }