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 vote310 views1 answer
Linux x11 copy paste event
C++
1 vote289 views1 answer
Std string to wstring
C++
0 vote288 views1 answer
Distructor of the node of the link list
C++
1 vote337 views2 answers
Read comma separated text file in c++
C++
0 vote334 views1 answer
C++ write string
C++
1 vote321 views1 answer
How to put bitset into a string in c++
C++
0 vote281 views1 answer
Qt make widget ignore mouse events
C++
-3 votes375 views2 answers
Virtual function in C++
C++
0 vote301 views1 answer
Random key generator c++ all unique characters
C++
0 vote445 views1 answer
Changing values of mat in opencv c++
C++