Submission

Status:

PPPPPPPPPP

Subtask/Task Score:

100/100

Score: 100

User: peilin

Problemset: อนุกรม

Language: c

Time: 0.002 second

Submitted On: 2025-10-10 20:33:42

#include <stdio.h>

int main() {
    int n;
    long long fib[101]; 

    scanf("%d", &n);

    fib[1] = 1;
    fib[2] = 1;

    for(int i = 3; i <= n; i++) {
        fib[i] = fib[i - 1] + fib[i - 2];
    }

    printf("%lld\n", fib[n]);

    return 0;
}