GCD

Medium Recursion

Solve in Playground →

Problem Statement

Write a C++ recursive function that computes the Greatest Common Divisor (GCD) of two numbers using the Euclidean algorithm.

Input Format

Two space-separated positive integers A and B.

Output Format

Print the GCD value.

Constraints

1 <= A, B <= 1000000

Sample Input

24 36

Sample Output

Explanation

Calculates GCD recursively: `gcd(a, b) = gcd(b, a % b)`.

Starter Code

#include <iostream>

int recursiveGcd(int a, int b) {
    // Write your code here
}

int main() {
    int a, b;
    if (std::cin >> a >> b) {
        std::cout << recursiveGcd(a, b) << "n";
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →