GCD(x, yz)

long long g = gcd(x, y);
return g * gcd(x / g, z);

Source: codeforces.com

Gcd = 1

import java.util.Scanner;
public class   Euclid {
    static public void main(String[] argh){
        System.out.print("Enter two numbers: ");
        Scanner input = new Scanner(System.in);
        int a = input.nextInt();
        int b = input.nextInt();
        int TEMP = 0 ;
        int GCD = 0;
        int max = a>b?a:b;
        int min = a<b?a:b;
        while(min!=0){
            TEMP=(max%min);
            GCD = min ;
            min = TEMP;
        }
        System.out.print("("+GCD+")");
    }
}

Similar codes

0 vote147 views1 answer
Void linux java
C++
5 votes137 views3 answers
Cpp random number in range
C++
0 vote135 views2 answers
C++ uint8_t header
C++
7 votes141 views2 answers
C++ threads
C++
0 vote140 views1 answer
Display dot product of two Arrays.
C++
4 votes145 views2 answers
Check uppercase c++
C++
-2 votes246 views4 answers
Function Template in c++
C++
1 vote130 views1 answer
Char type casting in c++
C++
5 votes138 views2 answers
Bitwise count total set bits
C++
2 votes148 views1 answer
Pbds in c++
C++