斐波那契(Fibonacci)

<span style="font-family: tahoma, arial, 宋体; font-size: 14px; background-color: rgb(221, 237, 251);">递归实现</span>

#include<stdio.h>
int fib(int n)
{
    if(n==1||n==2)
        return 1;
    else
        return fib(n-1)+fib(n-2);
}
int main()
{
    int m;
    scanf("%d",&m);
    while(m--)
    {
       int n;
       scanf("%d",&n);
       printf("%d\n",fib(n));
    }
}