sotanishy's code snippets for competitive programming
View the Project on GitHub sotanishy/cp-library-cpp
#define PROBLEM "https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod" #include <bits/stdc++.h> #include "../../math/arbitrary_modint.hpp" #include "../../math/combination.cpp" using namespace std; using ll = long long; using mint = ArbitraryModint; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int T, m; cin >> T >> m; mint::set_mod(m); Combination<mint> comb(min(m, (int)1e7) - 1); while (T--) { int n, k; cin >> n >> k; cout << comb.comb(n, k) << "\n"; } }
#line 1 "test/yosupo/binomial_coefficient_prime_mod.test.cpp" #define PROBLEM "https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod" #include <bits/stdc++.h> #line 5 "math/arbitrary_modint.hpp" /** * @brief Arbitrary Mod int */ class ArbitraryModint { using mint = ArbitraryModint; public: static int& mod() { static int mod_ = 1; return mod_; } static void set_mod(int mod_) { assert(mod_ > 0); mod() = mod_; } ArbitraryModint(long long y = 0) : x(y >= 0 ? y % mod() : (y % mod() + mod()) % mod()) {} int val() const { return x; } mint& operator+=(const mint& r) { if ((x += r.x) >= mod()) x -= mod(); return *this; } mint& operator-=(const mint& r) { if ((x += mod() - r.x) >= mod()) x -= mod(); return *this; } mint& operator*=(const mint& r) { x = static_cast<int>(1LL * x * r.x % mod()); return *this; } mint& operator/=(const mint& r) { return *this *= r.inv(); } bool operator==(const mint& r) const { return x == r.x; } mint operator+() const { return *this; } mint operator-() const { return mint(-x); } friend mint operator+(const mint& l, const mint& r) { return mint(l) += r; } friend mint operator-(const mint& l, const mint& r) { return mint(l) -= r; } friend mint operator*(const mint& l, const mint& r) { return mint(l) *= r; } friend mint operator/(const mint& l, const mint& r) { return mint(l) /= r; } mint inv() const { int a = x, b = mod(), u = 1, v = 0; while (b > 0) { int t = a / b; std::swap(a -= t * b, b); std::swap(u -= t * v, v); } return mint(u); } mint pow(long long n) const { mint ret(1), mul(x); while (n > 0) { if (n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend std::ostream& operator<<(std::ostream& os, const mint& r) { return os << r.x; } friend std::istream& operator>>(std::istream& is, mint& r) { long long t; is >> t; r = mint(t); return is; } private: int x; }; #line 3 "math/combination.cpp" template <typename mint> class Combination { public: Combination() = default; Combination(int n) : fact_(n + 1), fact_inv_(n + 1) { fact_[0] = 1; for (int i = 1; i <= n; ++i) fact_[i] = fact_[i - 1] * i; fact_inv_[n]=fact_[n].inv(); for (int i = n; i > 0; --i) fact_inv_[i - 1] = fact_inv_[i] * i; } mint perm(int n, int k) const { if (k < 0 || n < k) return 0; return fact_[n] * fact_inv_[n - k]; } mint comb(int n, int k) const { if (k < 0 || n < k) return 0; return fact_[n] * fact_inv_[k] * fact_inv_[n - k]; } mint fact(int n) const { return fact_[n]; } mint fact_inv(int n) const { return fact_inv_[n]; } private: std::vector<mint> fact_, fact_inv_; }; template <typename T> T comb(long long n, int k) { if (k < 0 || n < k) return 0; T num = 1, den = 1; for (int i = 1; i <= k; ++i) { num = num * (n - i + 1); den = den * i; } return num / den; } #line 7 "test/yosupo/binomial_coefficient_prime_mod.test.cpp" using namespace std; using ll = long long; using mint = ArbitraryModint; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int T, m; cin >> T >> m; mint::set_mod(m); Combination<mint> comb(min(m, (int)1e7) - 1); while (T--) { int n, k; cin >> n >> k; cout << comb.comb(n, k) << "\n"; } }