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 votes121 views3 answers
C++ string find last number
C++
3 votes121 views1 answer
Delete one specific character in string C++
C++
1 vote142 views1 answer
Vector erase not working c++
C++
0 vote126 views1 answer
New float array c++
C++
1 vote130 views1 answer
Turn github into vscode
C++
0 vote127 views1 answer
C++ get type name of object
C++
4 votes131 views2 answers
Round double to n decimal places c++
C++
0 vote84 views1 answer
Press enter to continue c++
C++
0 vote158 views5 answers
Return tuple or null
C++
0 vote149 views1 answer
Q10
C++