math/rem_euclid.cpp

• View this file on GitHub
• Last update: 2021-11-01 18:27:47+09:00

Required by

• algorithm/convolution_arbitrary_mod.cpp
• algorithm/convolution_int.cpp
• algorithm/convolution_mod.cpp
• internal/modulo_transform.cpp
• math/congruence_equations.cpp
• math/dynamic_modint.cpp
• math/inv_gcd.cpp
• math/mod_inv.cpp
• math/mod_pow.cpp
• math/primitive_root.cpp
• math/static_modint.cpp

Verified with

• test/and_convolution.test.cpp
• test/berlekamp_massey.test.cpp
• test/convolution_arbitrary_mod.test.cpp
• test/convolution_mod.test.cpp
• test/fp_util.test.cpp
• test/heavy_light_decomposition.test.cpp
• test/lazy_segment_tree.test.cpp
• test/queue_aggregation.test.cpp
• test/segment_tree.test.cpp
• test/semiring_matrix.test.cpp
• test/subset_convolution.test.cpp

Code

#pragma once
#include <cassert>

template <class T> constexpr T rem_euclid(T value, const T& mod) {
    assert(mod > 0);
    return (value %= mod) >= 0 ? value : value + mod;
}

#line 2 "math/rem_euclid.cpp"
#include <cassert>

template <class T> constexpr T rem_euclid(T value, const T& mod) {
    assert(mod > 0);
    return (value %= mod) >= 0 ? value : value + mod;
}

Back to top page