GCD

Easy Recursion PRO

🔒 Login to Unlock

Problem Statement

Write a C program using recursion (Euclidean algorithm) to find the Greatest Common Divisor (GCD) of two numbers.

Input Format

Two space-separated integers.

Output Format

Print the GCD.

Constraints

1 <= a, b <= 1000

Sample Input

48 18

Sample Output

Explanation

Recursive relation: gcd(a, b) = gcd(b, a % b) with base case when b becomes 0 returning a.

Starter Code

#include <stdio.h>

int gcd(int a, int b) {
    // Write your 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

🔒 Login to Unlock