- Notifications
You must be signed in to change notification settings - Fork 81
/
Copy pathlcm.cpp
76 lines (71 loc) · 1.5 KB
/
lcm.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
/*Author : Abdallah Hemdan */
/***********************************************/
/* Dear online judge:
* I've read the problem, and tried to solve it.
* Even if you don't accept my solution, you should respect my effort.
* I hope my code compiles and gets accepted.
* ___ __
* |\ \|\ \
* \ \ \_\ \
* \ \ ___ \emdan
* \ \ \\ \ \
* \ \__\\ \_\
* \|__| \|__|
*/
#include<iostream>
#include<cmath>
#include<string>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<iomanip>
#include<assert.h>
#include<vector>
#include<cstring>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<set>
#include<complex>
#include<list>
#include<climits>
#include<cctype>
#include<bitset>
#include<numeric>
#include<array>
#include<tuple>
#include<stdexcept>
#include<utility>
#include<functional>
#include<locale>
#defineall(v) v.begin(),v.end()
#definemp make_pair
#definepb push_back
#defineendl'\n'
typedeflonglongint ll;
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
usingnamespacestd;
// Find gcd For Two Numbers
ll gcd(ll a, ll b) {
while (b) {
ll tmp = a % b;
a = b;
b = tmp;
}
return a;
}
// Find Lcm For Two Numbers
ll lcm(ll a, ll b) {
return a / (ll)(gcd(a, b))* b;
}
intmain() {
int a, b;
cin >> a >> b;
cout << lcm(a, b) << endl;
}