Greatest Common Divisor (GCD) - Recursive

#include <iostream>

#include <cstdio>

using namespace std;



int gcd(int a, int b){

    if(b==0)return a;

    return gcd(b,a%b);

}



int main()

{

    int n,m;

    //freopen("input.txt","r",stdin);

    while(scanf("%d %d",&n,&m)==2){

        printf("%d\n",gcd(n,m));

    }

    return 0;

}