25
Algorithms library
[algorithms]
25.9
Generalized numeric operations
[numeric.ops]
25.9.13
Greatest common divisor
[numeric.ops.gcd]
ðŸ”—
template
<
class
M,
class
N
>
constexpr
common_type_t
<
M,N
>
gcd
(
M m, N n
)
;
1
#
Mandates:
M
and
N
both are integer types and not
cv
bool
.
2
#
Preconditions:

m

and

n

are representable as a value of
common_type_t
<
M, N
>
.
[
Note
:
These requirements ensure, for example, that
gcd
(
m,
m
)
=

m

is representable as a value of type
M
.
â€”
end note
]
3
#
Returns:
Zero when
m
and
n
are both zero
.
Otherwise, returns the greatest common divisor of

m

and

n

.
4
#
Throws:
Nothing
.