Problem G: 零起点学算法86——Fibonacc

Posted 2021-01-19 chenlong991223

#include<stdio.h>
int main(){
    int T,a[50]={0,1,1};
    for(int i=3;i<=45;i++)
    {
        a[i]=a[i-1]+a[i-2];
    }
    scanf("%d",&T);
    for(int i=0;i<T;i++)
    {
        int n;
        scanf("%d",&n);
        printf("%d
",a[n]);
    }
    return 0;
}