Submission

Score: 100

User: ThreeDee

Problemset: อนุกรม

Language: c

Time: 0.002 second

Submitted On: 2025-11-22 11:11:52

#include <stdio.h>
#define int long long
int memo[102];
int fibo(int n){
    if(n<=2 && n>0){
        return 1;
    }
    if(memo[n]!=0){
        return memo[n];
    }
    return memo[n]=(fibo(n-1)+fibo(n-2));
}

int main(){
    int a;
    scanf("%lld",&a);
    printf("%lld",fibo(a));
    return 0;
}