mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-03-27 17:06:44 +00:00
Create 001
solution for problem 001
This commit is contained in:
parent
6e24935f88
commit
c2aa074304
25
project_euler/problem_001/001
Normal file
25
project_euler/problem_001/001
Normal file
@ -0,0 +1,25 @@
|
||||
# solved #001
|
||||
"""
|
||||
Project Euler Problem 1: https://projecteuler.net/problem=1
|
||||
|
||||
Multiples of 3 or 5
|
||||
|
||||
"""
|
||||
|
||||
def solution(n: int = 1000) -> int:
|
||||
"""
|
||||
For number i in 1 to 1000 we take modulus of 3 and 5 with each number and when any of their value is zero we add that number to sum_count varialbe.
|
||||
|
||||
"""
|
||||
n = 1000
|
||||
sum_count = 0
|
||||
for i in range(1,n+1):
|
||||
if i%3==0 or i%5==0:
|
||||
sum_count += i
|
||||
|
||||
return sum_count
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
print(f"{solution() = }")
|
||||
|
Loading…
x
Reference in New Issue
Block a user