FibonaccTime Limit:1000MSMemory Limit:65536KTotal Submit:1185 Accepted:639DescriptionFibonacci数列定义为（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. InputThe 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 int g(int n){
int s;if(n==0)return 0; else if(n==1)return 1; else{return (g(n-1)+g(n-2)); } }main(){ int n,i; int a[50],f[50];scanf("%d",&n); for(i=0;i<n;i++) {scanf("%d",&a); } for(i=0;i<n;i++) {
f[a]=g(a); printf("%d\n",f[a]);}}
|
