A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://en.cppreference.com/w/cpp/language/../algorithm/../../cpp/header/../experimental/lcm.html below:

std::experimental::lcm - cppreference.com

Merged into ISO C++ The functionality described on this page was merged into the mainline ISO C++ standard as of 6/2016, see std::lcm (since C++17) (library fundamentals TS v2)

Computes the least common multiple of the integers m and n.

[edit] Parameters [edit] Return value

If either m or n is zero, returns zero. Otherwise, return the least common multiple of |m| and |n|.

[edit]

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

The behavior is undefined if |m|, |n| or the least common multiple of |m| and |n| is not representable as a value of type std::common_type_t<M, N>.

[edit] Exceptions

Throws no exceptions.

[edit] See also constexpr function template returning the greatest common divisor of two integers
(function template) [edit]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4