Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
32 changes: 32 additions & 0 deletions project_euler/problem_01/sol7.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
"""
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
"""

result = 0
for i in range(n):
if i % 3 == 0:
result += i
elif i % 5 == 0:
result += i
return result


if __name__ == "__main__":
print(solution(int(input().strip())))
46 changes: 46 additions & 0 deletions project_euler/problem_02/sol5.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,46 @@
"""
Problem:
Each new term in the Fibonacci sequence is generated by adding the previous two
terms. By starting with 1 and 2, the first 10 terms will be:

1,2,3,5,8,13,21,34,55,89,..

By considering the terms in the Fibonacci sequence whose values do not exceed
n, find the sum of the even-valued terms. e.g. for n=10, we have {2,8}, sum is
10.
"""


def solution(n):
"""Returns the sum of all fibonacci sequence even elements that are lower
or equals to n.

>>> solution(10)
10
>>> solution(15)
10
>>> solution(2)
2
>>> solution(1)
0
>>> solution(34)
44
"""

a = [0,1]
i = 0
while a[i] <= n:
a.append(a[i] + a[i+1])
if a[i+2] > n:
break
i += 1
sum = 0
for j in range(len(a) - 1):
if a[j] % 2 == 0:
sum += a[j]

return sum


if __name__ == "__main__":
print(solution(int(input().strip())))