Algorithm/ProjectEuler
[ProjectEuler] 프로젝트 오일러 Problem 5
HAS3ONG
2019. 6. 28. 01:31
def gcd(a, b):
while b is not 0:
d = a % b
a = b
b = d
return a
def lcm(a, b):
return a * b // gcd(a, b)
ans = 0
SUM = 1
for i in range(1, 20):
ans = lcm(i, SUM)
SUM = ans
print(ans)
출처