Greatest Common Divisor

The greatest common divisor (gcd) of two or more integers, when at least one of them is not zero, is the largest positive integer that divides the numbers without a remainder.

The GCD of more than two numbers can be calculated as

GCD(a,b,c) = GCD(GCD(a,b),c)

The most famous method of finding GCD is the Euclidean GCD Algorithm:

Euclidean GCD Algorithm

    int gcd(a, b) {
        while (b != 0) {
            t = b;
            b = a % b; \\ a mod b
            a = t;
        }
        return a;
    }

    Recursive version  

    int gcd(a, b) {
        if (b = 0) 
            return a
        else
            return gcd(b, a mod b)
    }
 
Related challenge for Greatest Common Divisor
Go to Top
  1. Challenge Walkthrough
    Let's walk through this sample challenge and explore the features of the code editor.1 of 6
  2. Review the problem statement
    Each challenge has a problem statement that includes sample inputs and outputs. Some challenges include additional information to help you out.2 of 6
  3. Choose a language
    Select the language you wish to use to solve this challenge.3 of 6
  4. Enter your code
    Code your solution in our custom editor or code in your own environment and upload your solution as a file.4 of 6
  5. Test your code
    You can compile your code and test it for errors and accuracy before submitting.5 of 6
  6. Submit to see results
    When you're ready, submit your solution! Remember, you can go back and refine your code anytime.6 of 6
  1. Check your score