<reponame>stravajiaxen/project-euler-solutions
"""
Copyright <NAME> (Stravajiaxen)
Licensed under MIT License -- do whatever you want with this, just don't sue me!

This code attempts to solve Project Euler (projecteuler.net) Problem #5 Smallest multiple

2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.

What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
"""

def main():

    # Determined manually...
    nums = {
        2: [2],
        3: [3],
        4: [2, 2],
        5: [5],
        6: [2, 3],
        7: [7],
        8: [2, 2, 2],
        9: [3, 3],
        10: [2, 5],
        11: [11],
        12: [2, 2, 3],
        13: [13],
        14: [2, 7],
        15: [3, 5],
        16: [2, 2, 2, 2],
        17: [17],
        18: [2, 3, 3],
        19: [19],
        20: [2, 2, 5]
    }

    prods = [2, 2, 2, 2, 3, 3, 5, 7, 11, 13, 17, 19]


    tot = 1

    for i in prods:
        tot *= i

    print(tot)

if __name__ == '__main__':
    main()