计蒜客-An Olympian Math Problem（水题）

#include <iostream>
#include<cstdio>
using namespace std;
int a;

int main()
{
    int n;
    scanf("%d",&n);
    while(n--){
        scanf("%d",&a);
        int fib[a+5]; fib[1] = 1; fib[0] = 1;
        for(int i = 2; i < a; i++)
            fib[i] = fib[i-1] + fib[i-2];
        printf("%d\n",fib[a-1]);
    }
    return 0;
}

注意开long long