Modint用の階乗計算関数です。 (daylight/math/fact.hpp)

• View this file on GitHub
• Last update: 2024-12-26 20:32:55+09:00
• Include: #include "daylight/math/fact.hpp"

Depends on

• 基本テンプレート (daylight/base.hpp)
• 繰り返し2乗法でa^p mod mを求める (daylight/math/powmod.hpp)

Required by

• daylight/math/all.hpp

Code

#include "daylight/base.hpp"
#include "daylight/math/powmod.hpp"
/// @brief Modint用の階乗計算関数です。
/// @tparam T modintの型
/// @param N 求める階乗の最大値
/// @param fact out:階乗
template<class T>
void setFact(int N, vector<T> &fact) {
	fact = vector<T>(N + 1);
	fact[0] = T(1);
	FOR(i, 1, N + 1) {
		fact[i] = fact[i - 1] * i;
	}
}
/// @brief ll用の階乗およびその逆元計計算関数で。
/// @param N 求める会場の最大値
/// @param fact out:階乗
/// @param inv out:階乗の逆元
void setFact(int N, vll &fact, vll &inv) {
	fact = vector<ll>(N + 1);
	inv = vector<ll>(N + 1);
	fact[0] = 1;
	FOR(i, 1, N + 1) {
		fact[i] = (fact[i - 1] * i) % MOD;
	}
	inv[N] = powmod(fact[N], MOD - 2);
	REPR(i, N) {
		inv[i] = inv[i + 1] * (i + 1) % MOD;
	}
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
  File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 482, in update
    self.update(
  File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 477, in update
    raise BundleErrorAt(
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: daylight/base.hpp: line 103: unable to process #include in #if / #ifdef / #ifndef other than include guards

Back to top page