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 vote360 views1 answer
Mkdir boost filesystem
C++
35 votes328 views2 answers
How to remove middle element in vector c++
C++
0 vote323 views7 answers
C code to mips assembly converter online
C++
0 vote389 views1 answer
Split 2d array into chunks in c++
C++
1 vote347 views1 answer
Default access specifier in c++
C++
1 vote369 views1 answer
How to get a letter from the users string in c++
C++
0 vote317 views1 answer
C++ print binary treenode
C++
3 votes336 views3 answers
C++ compare strings
C++
0 vote324 views2 answers
C++ function for checking if a sting is a number
C++
0 vote380 views1 answer
How to format big numbers with commas in c++
C++