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 vote172 views1 answer
Size of set c++
C++
30 votes175 views2 answers
Integer range in c++
C++
0 vote172 views1 answer
Square gcode
C++
1 vote214 views1 answer
Program to convert int to int array c++
C++
0 vote166 views2 answers
C++ function for checking if a sting is a number
C++
1 vote220 views1 answer
Print linked list recursively c++
C++
0 vote199 views1 answer
Program in c++ for simple interest rate
C++
1 vote173 views1 answer
Gestd::getline with wstring
C++
25 votes182 views10 answers
Netflix
C++
0 vote173 views2 answers
Read a file line by line c++ struct site:stackoverflow.com
C++