HOJ 2065 Fibonacci Number

http://acm.hit.edu.cn/hoj/problem/view?id=2065

数据量很小 直接打表

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