std::gcd - cppreference.com (original) (raw)

Computes the greatest common divisor of the integers m and n.

If either M or N is not an integer type, or if either is (possibly cv-qualified) bool, the program is ill-formed.

If either |m| or |n| is not representable as a value of type std::common_type_t<M, N>, the behavior is undefined.

[edit] Parameters

[edit] Return value

If both m and n are zero, returns zero. Otherwise, returns the greatest common divisor of |m| and |n|.

[edit] Exceptions

Throws no exceptions.

[edit] Notes

[edit] Example

#include   int main() { constexpr int p{2 * 2 * 3}; constexpr int q{2 * 3 * 3}; static_assert(2 * 3 == std::gcd(p, q));   static_assert(std::gcd( 6, 10) == 2); static_assert(std::gcd( 6, -10) == 2); static_assert(std::gcd(-6, -10) == 2);   static_assert(std::gcd( 24, 0) == 24); static_assert(std::gcd(-24, 0) == 24); }

[edit] See also

| | computes the least common multiple of two integers (function template) [edit] | | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |