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 vote213 views1 answer
#include
C++
0 vote216 views1 answer
Zsh: segmentation fault ./provided_files.exe erosion X \.
C++
0 vote221 views1 answer
The program must enter a natural number n from the console and find the number previous to n that is not divisible by 2 , 3 and 5 .
C++
1 vote246 views1 answer
Qt window bottom bar
C++
-1 vote218 views1 answer
How to make a hello world program in c++
C++
1 vote230 views1 answer
Get window position
C++
3 votes231 views1 answer
Create a dictionary cpp
C++
17 votes242 views3 answers
PRINT IN C ++
C++
2 votes224 views2 answers
Print stack c++
C++
1 vote222 views1 answer
Chrono library c++
C++