2065.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2065 on 2005-09-19 at 19:29:07 */ 
#include <stdio.h>

int main()
{
    long fab[46], test, i;
    int n;
    
    fab[0] = 0;
    fab[1] = 1;
    for(i = 2; i < 46; i++) {
        fab[i] = fab[i-1] + fab[i-2];
    }
    scanf("%ld", &test);
    for(i = 0; i < test; i++) {
        scanf("%d", &n);
        printf("%ld\n", fab[n]);
    }
    
    return 0;
}