mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-28 07:21:07 +00:00
47a9ea2b0b
* Simplify code by dropping support for legacy Python * sort() --> sorted()
46 lines
989 B
Python
46 lines
989 B
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.
|
|
"""
|
|
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(input().strip())))
|