Module: GCD (Greatest Common Divisor)


Problem

3/10

Recursive GCD: Beginning (C++)

Problem

Two natural numbers A and B are given. It is required to find their greatest common divisor.
 
Input
Enter two natural numbers A and B (\(A, B <= 10^9\)) .
 
Output 
It is required to output GCD A and B.

Paste the missing piece of code into the program.

Examples
# Input Output
1 12 42 6


time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Insert the missing code snippets
C++
Write the program below 
#include<iostream>
using namespace std;
int gcd(int a, int b){      
}
int main(){
    int n,m;
    cin >> n >> m;
    cout << gcd(n, m);
    return 0;
}

     

Program check result

To check the solution of the problem, you need to register or log in!