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

25 votes341 views6 answers
Fibonacci
C++
1 vote353 views1 answer
Argument for c11 in c++
C++
3 votes299 views1 answer
Deque c++
C++
0 vote318 views1 answer
Set iterator
C++
0 vote305 views1 answer
How to clear a string in c++
C++
2 votes322 views3 answers
Linear search
C++
0 vote313 views1 answer
To toggle (flip the status of) the k-th item of the set
C++
0 vote320 views1 answer
InstallUtil.exe ConsoleApp
C++
6 votes273 views1 answer
C++ call static method
C++
0 vote313 views1 answer
. The cout with the insertion operator (<<) is used to print a statement
C++