Big Fibonacci Number by rolf

D={}
def f(n):
 n/=2 
 if n<2:D[n]=1
 if n not in D:D[n]=(f(-~n)*f(n)+f(~-n)*f(n-2))%10**9
 return D[n]
while 1:print f(input()*2)

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

To protect the system from spam, please input your favorite sport (hint: I believe its name must start with 'g', case insensitive)

download

return to the top page