๐Ÿ“ฆ ved015 / Codeforces-solution

๐Ÿ“„ lcm_in_o(logn).cpp ยท 19 lines
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19#include <iostream>
using namespace std;
long long gcd(long long a, long long b) 
{ 
  if (b == 0) 
    return a; 
  return gcd(b, a % b); 
} 
  
long long lcm(long long a, long long b) 
{ 
    return (a / gcd(a, b)) * b; 
} 

int main(){
    cout << lcm(15,20) << endl;
    return 0;
}