GCD in single line

// C++ program to find GCD of two numbers

#include <iostream>
using namespace std;

// Recursive function to return gcd of a and b in single line

int gcd(int a, int b)
{

    return b == 0 ? a : gcd(b, a % b);    
}

  
// Driver program to test above function

int main()
{

    int a , b ;
    cin>>a>>b;

    cout<<"GCD of "<<a<<" and "<<b<<" is "<<gcd(a, b);

    return 0;
}