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 vote280 views1 answer
#defie in c++
C++
10 votes249 views3 answers
Namespaces in c++
C++
0 vote274 views1 answer
Compile c++ program
C++
0 vote273 views1 answer
Strring length in c++
C++
2 votes290 views2 answers
Strlen in c++
C++
1 vote274 views2 answers
Bool to string arduino
C++
1 vote287 views1 answer
In c++ ++ how to write if without if
C++
0 vote265 views1 answer
Finding no of unique characters in a string c++
C++
0 vote265 views1 answer
Who made c++
C++
3 votes256 views1 answer
Delete one specific character in string C++
C++