Submission

Score: 50

User: SushiCodelnw

Problemset: อนุกรม

Language: c

Time: 0.002 second

Submitted On: 2025-09-25 12:42:40

#include <stdio.h>

int c[100] = {};

int fib(int n) {
    if (c[n] != 0) return c[n];
    c[n] = fib(n - 1) + fib(n - 2);
    return c[n];
}

int main() {
    c[0] = 1;
    c[1] = 1;
    int n;
    scanf("%d", &n);
    printf("%d\n", fib(n - 1));

    return 0;
}