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

5 votes188 views6 answers
For loop in cpp
C++
0 vote216 views1 answer
How to get steam id c++
C++
2 votes179 views2 answers
Count bits c++
C++
0 vote196 views1 answer
Graph using queue c++
C++
6 votes209 views6 answers
C++ sort vector
C++
0 vote216 views1 answer
Recursive factorial of a number
C++
0 vote197 views1 answer
PI IN C++ WITH CMATH
C++
3 votes187 views2 answers
Prints out the elements in the array c++
C++
0 vote192 views1 answer
Qt widget list set selected
C++
0 vote208 views1 answer
C++ poitner
C++