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 vote148 views1 answer
Function to calculate compound interest in C++
C++
9 votes179 views3 answers
Throw exception c++
C++
0 vote125 views1 answer
Pow without math.h
C++
1 vote125 views1 answer
Naive pattern matching algorithm
C++
1 vote134 views1 answer
Std::stack
C++
0 vote140 views2 answers
Ue4 c++ switch enum
C++
0 vote164 views1 answer
Creare array con c++
C++
5 votes119 views3 answers
Pneumonia
C++
0 vote118 views1 answer
Insertion overloading in c++
C++
0 vote129 views1 answer
How to bath without water
C++