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 vote150 views1 answer
Resize method in c++ for arrays
C++
0 vote169 views1 answer
Std::is_standard_layout
C++
16 votes152 views6 answers
Sort vector c++
C++
10 votes171 views2 answers
2d vector c++ declaration
C++
0 vote154 views1 answer
C++ thread wait fro 1 sec
C++
0 vote152 views1 answer
C++ fonksion pointer
C++
0 vote145 views1 answer
C++ measure time in microseconds
C++
0 vote146 views3 answers
C++ Dynamic allocation failing
C++
1 vote144 views2 answers
Rotate in cpp
C++
1 vote154 views1 answer
Implementation of Extended Euclidian theorem
C++