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 vote248 views1 answer
HackerEarth questions Siemens
C++
0 vote225 views2 answers
C++ memory leak
C++
0 vote241 views1 answer
Creare array con c++
C++
0 vote221 views1 answer
& before function arg in cpp
C++
326 votes323 views3 answers
How to remove to an Array
C++
3 votes248 views1 answer
Abs c++
C++
-1 vote213 views1 answer
What does for do in c++
C++
0 vote217 views2 answers
Easy way to encrypt a c++ file line by line
C++
0 vote289 views1 answer
Opencv compile c++
C++
0 vote240 views1 answer
C++ program to count number of characters of words in a file using stringstream
C++