代码

#include <stdio.h>
#include <string.h>
long long F[233];

long long fib(int n) {
    if (F[n] != -1)
        return F[n];
    else
        return F[n] = fib(n - 1) + fib(n - 2);
}

int main() {
    memset(F, -1, sizeof(F));
    F[0] = 0, F[1] = 0, F[2] = 1;
    printf("%lld %lld %lld\n", fib(20), fib(40), fib(80));
}

评测结果