mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-18 01:00:15 +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
61 lines
1.2 KiB
Python
61 lines
1.2 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.
|
|
"""
|
|
|
|
|
|
def solution(n: int = 1000) -> int:
|
|
"""
|
|
This solution is based on the pattern that the successive numbers in the
|
|
series follow: 0+3,+2,+1,+3,+1,+2,+3.
|
|
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
|
|
num = 0
|
|
while 1:
|
|
num += 3
|
|
if num >= n:
|
|
break
|
|
sum += num
|
|
num += 2
|
|
if num >= n:
|
|
break
|
|
sum += num
|
|
num += 1
|
|
if num >= n:
|
|
break
|
|
sum += num
|
|
num += 3
|
|
if num >= n:
|
|
break
|
|
sum += num
|
|
num += 1
|
|
if num >= n:
|
|
break
|
|
sum += num
|
|
num += 2
|
|
if num >= n:
|
|
break
|
|
sum += num
|
|
num += 3
|
|
if num >= n:
|
|
break
|
|
sum += num
|
|
return sum
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(solution(int(input().strip())))
|