std::gcd
From cppreference.com
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Numerics library
Interpolations
Generic numeric operations
C-style checked integer arithmetic
Mathematical special functions (C++17)
Mathematical constants (C++20)
Basic linear algebra algorithms (C++26)
Data-parallel types (SIMD) (C++26)
Floating-point environment (C++11)
Bit manipulation (C++20)
Saturation arithmetic (C++26)
gcd
(C++17)
(C++17)
(C++20)
(C++20)
(C++17)
(C++17)
(C++17)
(C++17)
(C++17)
(C++17)
(C++26)
Defined in header
<numeric>
template< class M, class N >
constexpr std::common_type_t <M, N> gcd( M m, N n );
(since C++17)
constexpr std::common_type_t <M, N> gcd( M m, N n );
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
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] Exceptions
Throws no exceptions.
[edit] Notes
| Feature-test macro | Value | Std | Feature |
|---|---|---|---|
__cpp_lib_gcd_lcm |
201606L |
(C++17) | std::gcd, std::lcm
|
[edit] Example
Run this code
#include <numeric> 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); }