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 vote266 views1 answer
C++ cout colored output xcode
C++
0 vote265 views1 answer
Opengl draw cresent moon c++
C++
0 vote244 views1 answer
Sfml disable message
C++
8 votes260 views2 answers
Cpp print vector
C++
1 vote247 views1 answer
Detect cycle in an undirected graph
C++
1 vote234 views1 answer
Draw rect outline sdl2
C++
2 votes271 views1 answer
Stl function to reverse an array
C++
0 vote239 views1 answer
. Single-line comments start with two forward slashes (//).
C++
0 vote204 views1 answer
Case 1 or 2 c++
C++
12 votes255 views2 answers
Underline in latex
C++