Simple Fibonacci (recursive)

List of articles

• ​ ​Question​​
• ​ ​Ideas​​
• ​ ​Code​​

Question

The following sequence 0 1 1 2 3 5 8 13 21 … It's called the Fibonacci sequence .

This sequence starts at number one 3 A start , Each of these terms is equal to the sum of the first two terms .

Enter an integer N, Please output the first... Of this sequence N term .

Input format
An integer N.

Output format
Output the first... Of the Fibonacci sequence in one line N term , The numbers are separated by spaces .

Data range
0<N<46
sample input ：
5
sample output ：
0 1 1 2 3

Ideas

Recurrence

Code

Log in and copy

      
      

       
       n 
       
       = 
       
       int(
       
       input())
       
       

       
       a 
       
       = 
       
       0
       
       

       
       b 
       
       = 
       
       1
       
       

       
       for 
       
       i 
       
       in 
       
       range(
       
       n):
       
       
    
       
       print(
       
       a,
       
       end
       
       =
       
       ' ')
       
       
    
       
       a,
       
       b 
       
       = 
       
       b, 
       
       a
       
       +
       
       b
      
      
      
      

       
       
1.
       
       
2.
       
       
3.
       
       
4.
       
       
5.
       
       
6.