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

3 votes105 views2 answers
Define and show the implementation of the functions of an arrayList.
C++
1 vote109 views3 answers
Right shift in c++
C++
1 vote127 views1 answer
C++ print byte as bit
C++
32 votes102 views2 answers
How to sort a vector in reverse c++
C++
0 vote91 views1 answer
Consell de forces polítiques de Catalunya
C++
-1 vote102 views1 answer
Delete file c
C++
0 vote110 views1 answer
Find largest number in each row in array c++ using function
C++
0 vote95 views1 answer
Print all substrings in c++
C++
0 vote104 views1 answer
C++ drop last element of list
C++
2 votes100 views2 answers
Palindrome checker in c++
C++