std::gcd
| Defined in header <numeric>
|
||
| template< class M, class N> constexpr std::common_type_t<M, N> gcd(M m, N n); |
(since C++17) | |
Computes the greatest common divisor of the integers m and n.
Contents |
[edit] Parameters
| m, n | - | integer values |
[edit] Return value
If both m and n are zero, returns zero. Otherwise, returns the greatest common divisor of |m| and |n|.
[edit] Remarks
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] Exceptions
Throws no exceptions.
[edit] See also
| (C++17) |
constexpr function template returning the least common multiple of two integers (function template) |

Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
