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 vote114 views1 answer
Gamemaker studio
C++
1 vote117 views1 answer
Sum of stack c++
C++
0 vote144 views1 answer
Concatenate two vectors c++
C++
0 vote118 views1 answer
Split the array there is an array val of n integers . A good subarray is defined as
C++
-2 votes65 views1 answer
2d array
C++
2 votes119 views1 answer
How to delete a node c++
C++
0 vote119 views1 answer
How to choose struct's endianness cpp
C++
0 vote118 views1 answer
Std::map get all keys
C++
5 votes114 views2 answers
C++ break Statement
C++
0 vote108 views1 answer
Bits/stdc++.h in c++
C++