问题 A: 零起点学算法86——Fibonacc 输入n个数，输出这n个数对应的fibonacc

题目描述

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.

样例输入 Copy

5
0
3
5
9
20

样例输出 Copy

0
2
5
34
6765

 本人代码如下：

#include<stdio.h>
int main()
{
	int n,a[50];
	a[0]=0;
	a[1]=1;
	for(int i=2;i<50;i++)
		a[i]=a[i-1]+a[i-2];

	scanf("%d",&n);
	int b[n];
	for(int i=0;i<n;i++)
		scanf("%d",&b[i]);

	for(int i=0;i<n-1;i++)
		printf("%d\n",a[b[i]]);
		printf("%d",a[b[n-1]]);
	return 0;
}