#!/usr/bin/env python
# -*- coding: utf-8 -*-
# @Time : 2021/7/15 13:30
# @Author : wutiande
def gcd(a,b):
if b==0:
return a
else:
return gcd(b,a%b)
if __name__ == '__main__':
a = int(input("input a:"))
b = int(input("input b:"))
ans = gcd(a,b)
print('ans:',ans)
input a:49
input b:14
ans: 7
最小公倍数
最小公倍数 = a//d*b ,其中,d是a和b的最大公约数
#!/usr/bin/env python
# -*- coding: utf-8 -*-
# @Time : 2021/7/15 13:30
# @Author : wutiande
def gcd(a,b):
if b==0:
return a
else:
return gcd(b,a%b)
def lcm(a,b):
d = gcd(a,b)
return a//d*b
if __name__ == '__main__':
a = int(input("input a:"))
b = int(input("input b:"))
ans = lcm(a,b)
print('ans:',ans)
input a:4
input b:6
ans: 12