15_2_the_euclidean_algorithm_for_gcd.cpp

#include<iostream>
using namespace std;

int gcd(int a,int b){
    while(b!=0){
        int rem=a%b;
        a=b;
        b=rem;
    }
    return a;
}

int main(){
    int a,b;
    cin>>a>>b;

    cout<<gcd(a,b);


}