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

6 votes251 views9 answers
Preorder to postorder converter online
C++
0 vote263 views2 answers
C++ server service ros
C++
0 vote264 views1 answer
How to use printf with <cinttypes> c++
C++
1 vote241 views1 answer
What is _asm in C++
C++
0 vote261 views1 answer
Attack on titan junior high list of episodes
C++
0 vote242 views2 answers
Change colour of output to terminal c++
C++
0 vote290 views2 answers
Dynamic memory allocation c++
C++
0 vote251 views1 answer
C++ map values range
C++
15 votes238 views4 answers
How to make a random number in c++
C++
60 votes330 views2 answers
For(var i=0; i<=10; i++)
C++