Algorithm/0713_gcd.py at master · junha6316/Algorithm · GitHub

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
# import sys
# A, B = map(int, sys.stdin.readline()[:-1].split())
# def gcd(A,B):
#     gcd = min(A, B)
#     while (True):
#         r_A = A % gcd
#         r_B = B % gcd
#         if r_A == 0 and r_B == 0:
#            break
#         else:
#             gcd -=1
#
#
#     return gcd
#
# def lcf(A,B):
#     lcd=max(A,B)
#     while(True):
#         r_A = lcd % A
#         r_B = lcd % B
#         if r_A ==0  and r_B ==0:
#             break
#         else:
#             lcd += 1
#     return lcd
#
#
# print(gcd(A,B))
# print(lcf(A,B))

import sys

A, B = map(int, sys.stdin.readline()[:-1].split())


def gcd(A, B):
    while (B != 0):
        r = A % B
        A = B
        B = r

    return A


def lcm(A, B, gcd):
    return A * B / gcd


GCD = gcd(A, B)
LCM = lcm(A, B, GCD)

print(GCD)
print(LCM)