FIBONACCI SERIES

 In Fibonacci series, the next number is the sum of previous two numbers. The series starts with 0 and 1, and then the next numbers are a sum of the previous 2 numbers.

For example 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 etc.

Here the first 2 numbers are 0 and 1

The next numbers are:

  • 1 (= 1 + 0)
  • 2 (= 1 + 1)
  • 3 (= 2 + 1)
  • 5 (= 3 + 2)

And so on…

Write a program the first n numbers of the Fibonacci series.

Hint: You already know the first 2 values. How can you calculate the remaining?

Input Format

The first line contains T the number of test cases.

The following T lines contain n, the input for the Fibonacci Series.

Output Format

Print the values on a single line, separated by a space character. At the end of the line, print a new line.

Sample Input / Output

Input

5
3
4
8
9
7

Output
0 1 1
0 1 1 2
0 1 1 2 3 5 8 13
0 1 1 2 3 5 8 13 21
0 1 1 2 3 5 8



SOLUTION:

            

T=int(input())    #fortest cases


for i in range(T):


    n=int(input())


    s1=0


    s2=1


    print(s1,end=" ")      #end= to print next item in this same line adacently


    for i in range(n-1):    #n-1 because 1st value is printed


        s3=s1+s2


        s1=s2


        s2=s3


        if(i==n-2):


            print(s1)      #this is the last value of series 


        else:


            print(s1,end=" ")


Comments

Post a Comment

Popular posts from this blog

Efficient Janitor

  The janitor of a high school is insanely efficient. By the end of the day, all of the waster from the trash cans in the school has been shifted into plastic bags which can carry waster weighting between 1.01 pounds and 3.00 pounds. All of the plastic bags must be dumped into the trash cans outside the school. The janitor can carry at most 3.00 pounds at once. One trip is described as selecting a few bags which together don't weigh more than 3.00 pounds, dumping them in the outdoor trash can and returning to the school. The janitor wants to make minimum number of trips to the outdoor trash can. Given the number of plastic bags, n and the weights of each bag, determine the minimum number of trips if the janitor selects bags in the optimal way. For example, given  n=5 , plastic bags weighing weights  [1.01, 1.99, 2.5, 1.5, 1.01] , the janitor can carry all of the trash out in 3 trips:  [1.01+1.99, 2.5, 1.5+1.01] Constraints 1 <= n <= 1000 1.01 <= weight <=...
Read more

Right Arrow Pattern

Write a program to print the Right Arrow Pattern. Input Format: Take an input Integer which is from stdin. Output Format: print Right Arrow pattern Example Input: 5 Output: ***** **** *** ** * ** *** **** ***** SOLUTION: n=int(input()) for i in range(n):     for j in range(2*i):      #for spaces as each i th row has 2*i spaces         print(" ",end="")     for k in range(n-i):     #for stars as each i th row has n-i stars         print("*",end="")          print("")                     # half pattern is completed here for i in range(2,n+1):     #range started from 2 as the single star at middle is already                                         ...
Read more

X Pattern

  Write a program to take String if the length of String is odd print X pattern otherwise print INVALID. Input Format: Take a String as input from stdin. Output Format: print the desired Pattern or INVALID. Example Input: edyst Output: e t d s y d s e t SOLUTION: s=input() l=len(s) if(l%2 != 0): for i in range(0,l): j=l-i-1 for k in range(0,l): if(k==i or k==j): print(s[k],end="") else: print(end=" ") print("") else: print("INVALID")
Read more