other/ceildiv.cpp

• View this file on GitHub
• Last update: 2020-09-11 14:24:32+09:00

Required by

• Divisor Möbius Transform (algorithm/divisor_mobius_transform.cpp)
• Multiple Zeta Transform (algorithm/multiple_zeta_transform.cpp)
• w-ary Tree Set (data_structure/w_ary_tree_set.cpp)

Verified with

• test/w_ary_tree_set.pred.test.cpp
• test/w_ary_tree_set.test.cpp

Code

template <class T> constexpr T ceildiv(const T &n, const T &d) {
  return n / d + (n % d != 0 ? 1 : 0);
}

#line 1 "other/ceildiv.cpp"
template <class T> constexpr T ceildiv(const T &n, const T &d) {
  return n / d + (n % d != 0 ? 1 : 0);
}

Back to top page