mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-28 07:21:07 +00:00
267b5eff40
* Added doctest and more explanation about Dijkstra execution. * tests were not passing with python2 due to missing __init__.py file at number_theory folder * Removed the dot at the beginning of the imported modules names because 'python3 -m doctest -v data_structures/hashing/*.py' and 'python3 -m doctest -v data_structures/stacks/*.py' were failing not finding hash_table.py and stack.py modules. * Moved global code to main scope and added doctest for project euler problems 1 to 14. * Added test case for negative input. * Changed N variable to do not use end of line scape because in case there is a space after it the script will break making it much more error prone. * Added problems description and doctests to the ones that were missing. Limited line length to 79 and executed python black over all scripts. * Changed the way files are loaded to support pytest call. * Added __init__.py to problems to make them modules and allow pytest execution. * Added project_euler folder to test units execution * Changed 'os.path.split(os.path.realpath(__file__))' to 'os.path.dirname()'
51 lines
1.0 KiB
Python
51 lines
1.0 KiB
Python
"""
|
|
Problem:
|
|
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(divisible with no
|
|
remainder) by all of the numbers from 1 to N?
|
|
"""
|
|
from __future__ import print_function
|
|
|
|
try:
|
|
raw_input # Python 2
|
|
except NameError:
|
|
raw_input = input # Python 3
|
|
|
|
""" Euclidean GCD Algorithm """
|
|
|
|
|
|
def gcd(x, y):
|
|
return x if y == 0 else gcd(y, x % y)
|
|
|
|
|
|
""" Using the property lcm*gcd of two numbers = product of them """
|
|
|
|
|
|
def lcm(x, y):
|
|
return (x * y) // gcd(x, y)
|
|
|
|
|
|
def solution(n):
|
|
"""Returns the smallest positive number that is evenly divisible(divisible
|
|
with no remainder) by all of the numbers from 1 to n.
|
|
|
|
>>> solution(10)
|
|
2520
|
|
>>> solution(15)
|
|
360360
|
|
>>> solution(20)
|
|
232792560
|
|
>>> solution(22)
|
|
232792560
|
|
"""
|
|
g = 1
|
|
for i in range(1, n + 1):
|
|
g = lcm(g, i)
|
|
return g
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(solution(int(raw_input().strip())))
|