Advertisement
Guest User

Untitled

a guest
Jun 26th, 2019
71
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.24 KB | None | 0 0
  1. fn = [0,1]
  2. sum = 0
  3. n = 1
  4. while fn[n] < 4000000:
  5. n = n + 1
  6. fn.append(fn[n - 2] + fn[n - 1])
  7. if fn[n] % 2 == 0: #新しいフィボナッチの項が偶数ならば
  8. print(fn[n])
  9. sum = sum + fn[n]
  10.  
  11. print(fn)
  12. print(sum)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement