fjnu 1919 Fibonacci Number

Description

The Fibonacci Numbers {0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...} are defined by the recurrence:

Write a program to calculate the Fibonacci Numbers.

Input

The first line of the input file contains a single integer T, the number of test cases. The following T lines,
each contains an integer n ( 0 ≤ n ≤ 45 ), and you are expected to calculate F_n.

Output

Output F_n on a separate line.

Sample Input

4
3
5
9
20

 

Sample Output

2
5
34
6765

 

KEY:大整数问题；

Source:

#include < iostream >
using   namespace  std;

long  a[ 50 ];
int  n;

void  Fibonacci()
... {
    a[1]=a[2]=1;
    for(int i=3;i<=45;i++)
    ...{
        a[i]=a[i-1]+a[i-2];
    }
}

int  main()
... {
    cin>>n;
    Fibonacci();
    for(int i=1;i<=n;i++)
    ...{
        int c;
        cin>>c;
        cout<<a[c]<<endl;
    }
}