Fibonacci

Problem Statement

Input Format

An integer N.

Output Format

Print the Nth Fibonacci number.

Constraints

0 <= N <= 20

Sample Input

6

Sample Output

8

Explanation

Recursive relation: fib(n) = fib(n-1) + fib(n-2) with base cases fib(0) = 0 and fib(1) = 1.

Starter Code

#include <stdio.h>

int fibonacci(int n) {
    // Write your recursive logic here
}

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        printf("%dn", fibonacci(n));
    }
    return 0;
}

Limits

• Time Limit: 1s
• Memory Limit: 256MB