algorithm/Math/ModularArithmetic/modint_base.hpp

• View this file on GitHub
• Last update: 2025-07-03 00:41:25+09:00
• Include: #include "algorithm/Math/ModularArithmetic/modint_base.hpp"
• Link: View error logs on GitHub Actions

Required by

• Number Theoretic Transform（数論変換） (algorithm/Math/Convolution/number_theoretic_transform.hpp)
• algorithm/Math/ModularArithmetic/dynamic_modint.hpp
• algorithm/Math/ModularArithmetic/modint.hpp

Verified with

• verify/yosupo-convolution_mod-number_theoretic_transform.test.cpp
• verify/yosupo-convolution_mod-number_theoretic_transform.test.cpp
• verify/yosupo-point_set_range_composite-segment_tree.test.cpp
• verify/yosupo-range_affine_range_sum-lazy_segment_tree.test.cpp

Code

#ifndef ALGORITHM_MODINT_BASE_HPP
#define ALGORITHM_MODINT_BASE_HPP 1

#include <type_traits>

namespace algorithm {

class ModintBase {};

template <class T>
using is_modint = std::is_base_of<ModintBase, T>;

template <class T>
inline constexpr bool is_modint_v = is_modint<T>::value;

}  // namespace algorithm

#endif

#line 1 "algorithm/Math/ModularArithmetic/modint_base.hpp"



#include <type_traits>

namespace algorithm {

class ModintBase {};

template <class T>
using is_modint = std::is_base_of<ModintBase, T>;

template <class T>
inline constexpr bool is_modint_v = is_modint<T>::value;

}  // namespace algorithm

Back to top page