繰り返し2乗法でa^p mod mを求める (daylight/math/powmod.hpp)

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

Depends on

• 基本テンプレート (daylight/base.hpp)

Required by

• daylight/math/all.hpp
• Modint用の階乗計算関数です。 (daylight/math/fact.hpp)
• 素数判定 (O(log(N))) (daylight/math/primality_test.hpp)
• 素因数分解をO(N^(1/4))で行う (daylight/math/rho.hpp)

Verified with

• test/aoj/ntl/1_A.test.2.cpp
• test/aoj/others/1276.test.2.cpp
• test/yosupo/number_theory/factorize.test.cpp
• test/yosupo/number_theory/primality_test.test.cpp

Code

#pragma once
#include "daylight/base.hpp"
/// @brief 繰り返し2乗法でa^p mod mを求める
ll pow_mod(ll a, ll p, ll m) {
	using i128 = __int128_t;
	i128 ret = 1;
	i128 mul = a;
	for(; p > 0; p >>= 1) {
		if(p & 1) ret = (ret * mul) % m;
		mul = (mul * mul) % m;
	}
	return ll(ret);
}

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