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 vote276 views3 answers
Print 2d array c++
C++
0 vote299 views1 answer
Simple program for sign in and sign up in c++
C++
0 vote289 views1 answer
Temperature conversion in c++
C++
0 vote311 views2 answers
Comment savoir si un nombre est premier c++
C++
0 vote275 views1 answer
Who made c++
C++
2 votes270 views1 answer
Cin.tie c++
C++
1 vote284 views1 answer
C++ function parameters
C++
0 vote314 views1 answer
Sort html elements in Jquery on condition
C++
0 vote282 views1 answer
How the theam are store in database
C++
1 vote280 views1 answer
Regex for phone number c++
C++