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 vote295 views1 answer
Vector int initialize with increasing numbers
C++
1 vote272 views1 answer
What are various sections of process
C++
0 vote248 views1 answer
How to make a number always positive in c++
C++
0 vote269 views1 answer
C++ shared pointer operator bool
C++
0 vote321 views2 answers
. Shell sort in c++
C++
0 vote273 views1 answer
01matrix
C++
0 vote267 views1 answer
Get start with c++
C++
0 vote309 views1 answer
Vprintf
C++
1 vote249 views1 answer
How to check is some number is divisible by 3 in c++
C++
2 votes266 views1 answer
How to create a structure c++
C++