Fibonacci

Easy Recursion

Solve in Playground →

Problem Statement

Write a recursive C function to find the N-th Fibonacci number.

Input Format

A single integer N (0-indexed).

Output Format

Print the N-th Fibonacci term.

Constraints

0 <= N <= 20

Sample Input

Sample Output

Explanation

F(6) = 8 computed via recursion.

Starter Code

#include <stdio.h>

int fibonacci(int n) {
    // Write 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

Start Coding in IDE →