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 vote245 views1 answer
C++, for-loop over an array array
C++
2 votes261 views1 answer
Split vector in half cpp
C++
90 votes365 views5 answers
Tostring c++
C++
1 vote273 views2 answers
C++ display numbers as binary
C++
0 vote293 views1 answer
How to make dictionary of numbers in c++
C++
-1 vote271 views2 answers
C++ split string by sstream
C++
2 votes278 views1 answer
C++ code for insertion sort
C++
1 vote250 views1 answer
Separation between paragraphs latex
C++
0 vote313 views1 answer
What was the piep piper app
C++
0 vote275 views2 answers
Unambiguous
C++