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 vote173 views1 answer
What is the system function in c++
C++
0 vote195 views1 answer
What is c++ used for
C++
0 vote170 views2 answers
C++ typeid
C++
13 votes154 views5 answers
Max of a vector c++
C++
-1 vote167 views1 answer
C++ filesystem remove file
C++
1 vote152 views1 answer
Map in c
C++
0 vote157 views1 answer
Cpp mutex
C++
6 votes165 views4 answers
Map c++
C++
0 vote207 views1 answer
How to input a file path in c++
C++
2 votes168 views1 answer
C++ endl
C++