fork download
copy 
  1. # Função recursiva para calcular a sequência Fibonacci
  2.  
  3. def f(i,j,n): 
  4. 	return f(j,i+j,n-1) if n else i;
  5. def fibonacci(n): 
  6. 	return f(1,1,n-1);
  7.  
  8. print("Fibonacci(33) = ", fibonacci(33));
  9. print("Fibonacci(40) = ", fibonacci(40));
  10. print("Fibonacci(100) = ", fibonacci(100));
Success #stdin #stdout 0.02s 9984KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Fibonacci(33) =  3524578
Fibonacci(40) =  102334155
Fibonacci(100) =  354224848179261915075
https://ideone.com/7rXz0s
Resposta do Stack Overflow - Sequência fibonacci em Python
language:
Python 3 (python  3.9.5)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!