algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-19 19:03:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Cleanup Project Euler Problem 01 (#2900)

Browse Source 
* mv str statement into docstr

* rename var to avoid redefining builtin

* clean up module docstr
This commit is contained in:
Carlos Meza
2020-10-09 22:33:00 -07:00
committed by GitHub
parent c83e4b77c5
commit 927e14e7f2
7 changed files with 22 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
project_euler/problem_01/sol2.py
View File

@ -1,7 +1,7 @@
"""
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.
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.
"""
@ -19,14 +19,14 @@ def solution(n: int = 1000) -> int:
83700
"""
sum = 0
total = 0
terms = (n - 1) // 3
sum += ((terms) * (6 + (terms - 1) * 3)) // 2 # sum of an A.P.
total += ((terms) * (6 + (terms - 1) * 3)) // 2 # total of an A.P.
terms = (n - 1) // 5
sum += ((terms) * (10 + (terms - 1) * 5)) // 2
total += ((terms) * (10 + (terms - 1) * 5)) // 2
terms = (n - 1) // 15
sum -= ((terms) * (30 + (terms - 1) * 15)) // 2
return sum
total -= ((terms) * (30 + (terms - 1) * 15)) // 2
return total
if __name__ == "__main__":