mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-18 09:10:16 +00:00
edf2cd2b0c
Squashed commit of the following:
commit 6801d073b31bf702814861cd3b07b634ca295bfa
Author: Archaengel <god11341258@gmail.com>
Date: Mon Oct 5 16:40:10 2020 -0700
Fix typehints in project_euler/problem01
commit 29afc3af114abd1b99dc3f7c8fc99128229db131
Author: Archaengel <god11341258@gmail.com>
Date: Mon Oct 5 15:06:34 2020 -0700
Add typehints and default argument for project_euler/problem_01
34 lines
776 B
Python
34 lines
776 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: int = 1000) -> int:
|
|
"""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
|
|
"""
|
|
|
|
sum = 0
|
|
terms = (n - 1) // 3
|
|
sum += ((terms) * (6 + (terms - 1) * 3)) // 2 # sum of an A.P.
|
|
terms = (n - 1) // 5
|
|
sum += ((terms) * (10 + (terms - 1) * 5)) // 2
|
|
terms = (n - 1) // 15
|
|
sum -= ((terms) * (30 + (terms - 1) * 15)) // 2
|
|
return sum
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(solution(int(input().strip())))
|