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

1 vote150 views1 answer
Lpcwstr to string c++
C++
1 vote125 views1 answer
Qt qimage load from file
C++
1 vote121 views1 answer
Eosio get time
C++
3 votes80 views1 answer
Rapidjson parse
C++
0 vote109 views1 answer
C++ include <> vs ""
C++
0 vote118 views1 answer
Sweetalert2 email and password
C++
2 votes121 views1 answer
How to use string variable in switch case in c++
C++
0 vote131 views1 answer
Intage1 was not declared in this scope C++
C++
0 vote158 views1 answer
Sort vector of strings
C++
0 vote162 views1 answer
Iterating in map/unordered map c++
C++