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 vote158 views1 answer
I need to write an int function in which there are only cout statements and if I return 0/1 it prints them too.
C++
5 votes168 views6 answers
While loop c++
C++
2 votes141 views3 answers
Vector with initial size
C++
0 vote144 views1 answer
How to get an element in a list c++
C++
2 votes158 views1 answer
Clrscr in cpp
C++
0 vote164 views1 answer
Replace komma with space C++
C++
0 vote169 views2 answers
Print all number between a and b in c++
C++
0 vote154 views1 answer
Temporary mobile number
C++
1 vote187 views1 answer
Creator of C++
C++
0 vote166 views1 answer
Youtube backlink generator tool
C++