We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #5: Smallest multiple
  4. Discussions

Project Euler #5: Smallest multiple

  • uditjeet
     + 0 comments

    Python 3:

    #!/bin/python3

import sys

def findGCD(a,b):
    while b!=0:
        remainder = a%b
        a=b
        b=remainder
        
    return a
    
def lcmUsingGCD(a,b):
    return abs(a*b)//findGCD(a,b)
    
def numLCM(n):
    lcm=1
    for i in range(2, n+1):
        lcm = lcmUsingGCD(lcm, i)
    print(lcm)

t = int(input().strip())
for a0 in range(t):
    n = int(input().strip())
    numLCM(n)