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 vote104 views1 answer
Priority queue smallest first
C++
0 vote98 views1 answer
How to save system function output into a variable in c++
C++
0 vote103 views1 answer
Check whether K-th bit is set or not c++
C++
-1 vote113 views1 answer
C++ if else
C++
0 vote174 views1 answer
C++ random number generator uniform distribution
C++
0 vote111 views1 answer
Inverser les éléments d'un tableau manuellement en c++
C++
105 votes233 views6 answers
C++ int to string
C++
-1 vote109 views1 answer
? c++
C++
0 vote102 views1 answer
Select elements from array C++
C++
0 vote100 views1 answer
Cpp how to add collisions to boxes
C++