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 vote106 views3 answers
JAJA
C++
18 votes115 views5 answers
C++ clear console
C++
0 vote110 views1 answer
Compare values within within a vector c++
C++
213 votes274 views2 answers
C++ switch
C++
0 vote109 views1 answer
Create vector of specific size c++
C++
0 vote131 views1 answer
Decimal to binary gfg
C++
0 vote110 views1 answer
Prevent getting data from data-tooltip-content tippyjs
C++
0 vote151 views1 answer
Assert warning c++
C++
1 vote131 views1 answer
C++ functions inside functions
C++
0 vote211 views1 answer
C++ basic snippet
C++