FilesExpand file tree

 master

/

sol1.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

41 lines (33 loc) · 820 Bytes

 master

/

sol1.py

Copy path

Top

File metadata and controls

• Code
• Blame

41 lines (33 loc) · 820 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

"""

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

"""

i = 1

j = 2

sum = 0

while j <= n:

if j % 2 == 0:

sum += j

i, j = j, i + j

return sum

if __name__ == "__main__":

print(solution(int(input().strip())))