Ŀ

գҪıйص䡣
һ repeat (0<repeat<10) repeat 㣺
õݹ鷽дFabonacciĺֵΪ, дӦFabonacciеĶΪ
   f(n)=f(n-2)+f(n-1)  (n>=2)    f(0)=0f(1)=1
(Ϊ˵)

3	(repeat=3)
0
1
6

fib(0)=0
fib(1)=1
fib(6)=8



#include <stdio.h>
long fib(int n);
int main(void)
{
	int n,ri,repeat;

	scanf("%d",&repeat);
	for(ri=1;ri<=repeat;ri++){
		scanf("%d",&n);
		printf("fib(%d)=%ld\n",n,fib(n));
	}
}
/*---------*/