gcd of number
// pass two value to this function
public static int HCF(int a, int b)
{
while (b > 0)
{
int temp = b;
b = a % b; // % is remainder
a = temp;
}
return a;
}gcd algorithm
function gcd(a, b)
if b = 0
return a
else
return gcd(b, a mod b)GCD(x, yz)
long long g = gcd(x, y);
return g * gcd(x / g, z);Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
