GCD
static int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
Victorious Vendace
static int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
int gcd(int a, int b) {
while (b) b ^= a ^= b ^= a %= b;
return a;
}int gcd(int a,int b){
if(b==0) return a;
return gcd(b,a%b);
}import math
a = 10
b = 8
answer = math.gcd(10, 8)
print(answer)int gcd(int a,int b) {
while (a&&b) a>b?a%=b:b%=a;
return a+b;
}