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()'
54 lines
1.1 KiB
Python
54 lines
1.1 KiB
Python
"""
|
|
Problem Statement:
|
|
If we list all the natural numbers below 10 that are multiples of 3 or 5,
|
|
we get 3,5,6 and 9. The sum of these multiples is 23.
|
|
Find the sum of all the multiples of 3 or 5 below N.
|
|
"""
|
|
from __future__ import print_function
|
|
|
|
try:
|
|
raw_input # Python 2
|
|
except NameError:
|
|
raw_input = input # Python 3
|
|
|
|
|
|
def solution(n):
|
|
"""Returns the sum of all the multiples of 3 or 5 below n.
|
|
|
|
>>> solution(3)
|
|
0
|
|
>>> solution(4)
|
|
3
|
|
>>> solution(10)
|
|
23
|
|
>>> solution(600)
|
|
83700
|
|
"""
|
|
|
|
xmulti = []
|
|
zmulti = []
|
|
z = 3
|
|
x = 5
|
|
temp = 1
|
|
while True:
|
|
result = z * temp
|
|
if result < n:
|
|
zmulti.append(result)
|
|
temp += 1
|
|
else:
|
|
temp = 1
|
|
break
|
|
while True:
|
|
result = x * temp
|
|
if result < n:
|
|
xmulti.append(result)
|
|
temp += 1
|
|
else:
|
|
break
|
|
collection = list(set(xmulti + zmulti))
|
|
return sum(collection)
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(solution(int(raw_input().strip())))
|