GCD

Easy Recursion

Solve in Playground →

Problem Statement

Write a recursive C function to find the Greatest Common Divisor (GCD) of two integers.

Input Format

Two space-separated integers A and B.

Output Format

Print the GCD value.

Constraints

1 <= A, B <= 100000

Sample Input

24 36

Sample Output

Explanation

Euclidean algorithm implemented recursively gives 12.

Starter Code

#include <stdio.h>

int gcd(int a, int b) {
    // Write recursive logic here
}

int main() {
    int a, b;
    if (scanf("%d %d", &a, &b) == 2) {
        printf("%dn", gcd(a, b));
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →