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 vote300 views1 answer
Return the index where maximum element in a vector
C++
7 votes287 views1 answer
Insert at position in vector c++
C++
0 vote291 views1 answer
Thread group c++
C++
0 vote292 views1 answer
C++ read_ascii
C++
0 vote298 views1 answer
Waiting in a serial as the spool reflect the queue operation. Demonstrate Printer Behavior in context of Queue.Subject to the Scenario implement the Pop and Push Using C++.
C++
0 vote290 views1 answer
I2c slave onreceive
C++
0 vote300 views1 answer
Frequency of a substring in a string c++
C++
1 vote307 views1 answer
Hello world c++ visual studio
C++
0 vote311 views7 answers
Online compiler to calculator time complexity
C++
3 votes293 views3 answers
Map in cpp
C++