CPP program to find GCD of a ^ n and b .
#include <bits/stdc++.h> NEW_LINE using namespace std ; typedef long long int ll ; ll gcd ( ll a , ll b ) { if ( a == 0 ) return b ; return gcd ( b % a , a ) ; }