Submission

Score: 100

User: bbcctxp

Problemset: อนุกรม

Language: c

Time: 0.002 second

Submitted On: 2025-10-08 22:57:58

#include <stdio.h>

long long fibonacci(int n) {
    if (n<=0) return 0;
    if (n==1) return 1;

    long long a=0,b=1,next;
    for (int i=2;i<=n;i++) {
        next=a+b;
        a=b;
        b=next;
    }
    return b;
}

int main() {
    int n;
    scanf("%d", &n);
    printf("%lld", fibonacci(n));

    return 0;
}