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 vote132 views1 answer
Non stoichiometric nacl is yellow
C++
0 vote110 views1 answer
What is stdoutread in c++
C++
0 vote121 views1 answer
Show mouse c++
C++
4 votes118 views2 answers
C++ inline if
C++
6 votes109 views1 answer
Convert string to stream c++
C++
1 vote86 views1 answer
Random number between x and y c++
C++
1 vote108 views3 answers
Auto in cpp
C++
1 vote118 views1 answer
Hello world programming
C++
1 vote132 views1 answer
Check if intent has extras
C++
4 votes90 views2 answers
Poland
C++