all valid python 3

project_euler/problem_05/sol2.py

@@ -13,7 +13,7 @@ def gcd(x,y):
 def lcm(x,y):
     return (x*y)//gcd(x,y)
 
-n = int(raw_input())
+n = int(input())
 g=1
 for i in range(1,n+1):
     g=lcm(g,i)