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

2 votes307 views2 answers
Count bits c++
C++
0 vote364 views1 answer
Implementing split function in c++
C++
0 vote313 views2 answers
Function prototype c++
C++
0 vote340 views1 answer
Bfs sudocode
C++
0 vote309 views1 answer
SET TO NULL pointer c++
C++
19 votes328 views1 answer
C++ files
C++
5 votes360 views1 answer
C++ is string a number
C++
2 votes294 views2 answers
C++ sum the digits of an integer
C++
0 vote383 views1 answer
Flutter websocket auto reconnect
C++
-1 vote308 views1 answer
Multi initialisation if statement c++
C++