标签：log bit expect case src main output search stat
Fibonacci数列定义为（1,1,2,3,5,8,.....），即每个元素是前两个元素的和。如果一个Fibonacci数与所有小于它的Fibonacci数互质，那么称之为Fibonacci质数。
现在要求你输出前n个Fibonacci数
The Fibonacci Numbers {0, 1, 1,
2, 3, 5, 8, 13, 21, 34, 55 ...} are defined by the recurrence:
F(0)=0
F(1)=1
F(i)=F(i-1)+F(i-2)
Write a program to calculate the Fibonacci Numbers.
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 Fn
Output Fn on a separate line.
5
0
3
5
9
20
0
2
5
34
6765
1 #include<stdio.h> 2 int main(){ 3 int T,a[50]={0,1,1}; 4 for(int i=3;i<=45;i++){ 5 a[i]=a[i-1]+a[i-2]; 6 } 7 scanf("%d",&T); 8 for(int i=0;i<T;i++){ 9 int n; 10 scanf("%d",&n); 11 printf("%d\n",a[n]); 12 } 13 return 0; 14 }
标签：log bit expect case src main output search stat
原文地址：http://www.cnblogs.com/dddddd/p/6680735.html
