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

2 votes136 views2 answers
Anagram
C++
0 vote128 views2 answers
Use c++17 g++
C++
0 vote140 views1 answer
C++ call overriden method from constructor
C++
0 vote146 views1 answer
Namespace "std" n'a pas de membre "filesystem"
C++
1 vote159 views2 answers
Maximum value in map in c++
C++
0 vote143 views1 answer
How to show constellations in starry night orion special edition
C++
5 votes137 views4 answers
Split pdf
C++
0 vote155 views1 answer
Irremoteesp8266 example
C++
0 vote157 views1 answer
Compute the average of an array c++
C++
5 votes138 views2 answers
Use sleep in c in windows
C++