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

  • macdonald_l_kyn
     + 0 comments

    Python Solution, I cut some factor processing through prime checking 

    import math


def isPrime(n):
    if n == 1:
        return False
    if n % 2 == 0:
        return False
    for i in range(3, int(math.sqrt(n))+1, 2):
        if n % i == 0:
            return False
    return True


for t in range(int(input())):
    n = int(input())
    s = n
    while True:
        if not isPrime(s):
            for i in range(2, n + 1):
                if s % i != 0:
                    break
            else:
                print(s)
                break
        if s % 2 == 1:
            s += 1
        else:
            s += 2