Submission

Score: 70

User: phatto

Problemset: Fibonacci Croissant

Language: python

Time: 0.010 second

Submitted On: 2026-09-15 23:23:13

n = int(input())

def fibo(n):
    phi = (1 + 5 ** 0.5) / 2
    conjugate_phi = (1 - 5 ** 0.5) / 2
    return int((phi**n - conjugate_phi**n)/5**0.5)

totalsum = 0
for i in range(n+1):  
    totalsum = totalsum + fibo(i)

print(totalsum)