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 vote200 views1 answer
Temparory Email Id
C++
3 votes221 views1 answer
Create a dictionary cpp
C++
0 vote226 views1 answer
Cpp full form
C++
0 vote216 views2 answers
How to create array with not constant size in cpp
C++
0 vote246 views1 answer
C++ allocate and free dynamic 2d array
C++
2 votes226 views1 answer
Tribonacci series c++
C++
5 votes197 views3 answers
Int to float c++
C++
0 vote197 views1 answer
Print pattern and space in cpp
C++
-1 vote205 views1 answer
Template function in class c++
C++
1 vote270 views1 answer
Calculate time difference cpp
C++