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 vote188 views1 answer
String to decimal c++ strtol
C++
1 vote152 views1 answer
What is syntex for inheritence in c++
C++
0 vote175 views1 answer
Tabeau dynamique c++
C++
0 vote191 views2 answers
Dynamic memory allocation c++
C++
6 votes157 views4 answers
Map c++
C++
0 vote137 views1 answer
>> c++
C++
0 vote148 views1 answer
C++ do you not inherit constructor
C++
10 votes152 views2 answers
C++ convert binary string to decimal
C++
1 vote240 views1 answer
How to declare 1-D array in C/C++
C++
1 vote153 views3 answers
Google snake game
C++