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 vote172 views1 answer
C++ write string
C++
1 vote145 views1 answer
Uri online judge 3145 solution in c++
C++
0 vote139 views1 answer
Nearly similar rectangles hackerrank solution
C++
23 votes172 views6 answers
Team fortress
C++
0 vote230 views4 answers
Online c++ to c converter
C++
1 vote131 views1 answer
What is __asm in C++
C++
0 vote356 views1 answer
Stack overflow c++
C++
0 vote139 views2 answers
String to wstring conversion c++
C++
5 votes153 views1 answer
How to disable buttons in unity
C++
0 vote124 views0 answer
C++