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 vote197 views1 answer
Break input stream into words
C++
1 vote197 views2 answers
How to find the size of a character array in c++
C++
-1 vote181 views1 answer
A[12] = h + A[8]
C++
0 vote198 views1 answer
Udo apt install dotnet-sdk-5
C++
0 vote185 views2 answers
Get min and max element index from vector c++
C++
9 votes196 views4 answers
Max c++
C++
29 votes229 views10 answers
Hello world c++
C++
8 votes186 views2 answers
Check variable type c++
C++
0 vote193 views1 answer
C++ little endian or big endian
C++
4 votes195 views1 answer
Passing array to function c++ pointer
C++