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 vote175 views1 answer
Display dot product of two Arrays.
C++
1 vote173 views1 answer
Sfml mouse click
C++
1 vote168 views1 answer
Optimized Bubble Sort
C++
4 votes205 views3 answers
Number to binary string c++
C++
0 vote189 views1 answer
2d array of zeros c++
C++
2 votes159 views1 answer
Get elements of tuple c++
C++
-1 vote204 views1 answer
Ob for nginx.service failed because the control process exited with error code. See "systemctl status nginx.service" and "journalctl -xe" for details.
C++
1 vote166 views1 answer
Start with pure c++ and opengl gamedev
C++
-1 vote174 views1 answer
51 13 C:\Users\usuario\Documents\Destajo 1.cpp [Error] 'gotoxy' was not declared in this scope
C++
0 vote167 views3 answers
Script hack blox fruti
C++