test/math/Binomial_Coefficient.test.cpp

View this file on GitHub
Last update: 2024-02-16 18:48:16+09:00
Problem: https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod"

#include"../../template/template.hpp"

#include"../../utility/dynamic_modint.hpp"
#include"../../math/factorial.hpp"

using namespace lib;

using mint = dynamic_modint<-1>;
const int mx = 10'000'000;

int main(){
    int t, m; cin >> t >> m;
    mint::set_mod(m);
    Binom<mint> bnm(min(m-1,mx));
    while (t--){
        int n, k; cin >> n >> k;
        cout << bnm(n,k).val() << endl;
    }
}

#line 1 "test/math/Binomial_Coefficient.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod"

#line 2 "template/template.hpp"

#include <bits/stdc++.h>

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <typename T> bool chmin(T &a, const T &b) {
    if (a <= b) return false;
    a = b;
    return true;
}
template <typename T> bool chmax(T &a, const T &b) {
    if (a >= b) return false;
    a = b;
    return true;
}

namespace lib {

using namespace std;

}  // namespace lib

// using namespace lib;
#line 4 "test/math/Binomial_Coefficient.test.cpp"

#line 2 "utility/dynamic_modint.hpp"

#line 4 "utility/dynamic_modint.hpp"

namespace lib {

template <int id> struct dynamic_modint {
    using mint = dynamic_modint;
    ll a;
    static ll m;
    dynamic_modint (ll x = 0) : a((x % m + m) % m) {}
    static ll mod() {
        return m;
    }
    static void set_mod(ll mod){
        assert(1 <= mod);
        m = mod;
    }
    ll& val() {
        return a;
    }
    mint pow(ll n) {
        mint res = 1;
        mint x = a;
        while (n) {
            if (n & 1) res *= x;
            x *= x;
            n >>= 1;
        }
        return res;
    }
    mint inv() {
        return pow(m - 2);
    }
    mint& operator+=(const mint rhs) {
        a += rhs.a;
        if (a >= m) a -= m;
        return *this;
    }
    mint& operator-=(const mint rhs) {
        if (a < rhs.a) a += m;
        a -= rhs.a;
        return *this;
    }
    mint& operator*=(const mint rhs) {
        a = a * rhs.a % m;
        return *this;
    }
    mint& operator/=(mint rhs) {
        *this *= rhs.inv();
        return *this;
    }
    friend mint operator+(const mint& lhs, const mint& rhs) {
        return mint(lhs) += rhs;
    }
    friend mint operator-(const mint& lhs, const mint& rhs) {
        return mint(lhs) -= rhs;
    }
    friend mint operator*(const mint& lhs, const mint& rhs) {
        return mint(lhs) *= rhs;
    }
    friend mint operator/(const mint& lhs, const mint& rhs) {
        return mint(lhs) /= rhs;
    }
    mint operator+() const {
        return *this;
    }
    mint operator-() const {
        return mint() - *this;
    }
};

template<int id>
ll dynamic_modint<id>::m = 2;

} // namespace lib
#line 2 "math/factorial.hpp"

#line 4 "math/factorial.hpp"

namespace lib {

template<typename T>
struct Binom{
    Binom(int lim = 300000){
        if (kaijo.empty()){
            kaijo = {1,1};
            kainv = {1,1};
        }
        extend(lim);
    }
    static T fact(int x) {
        if (x < 0) return T(0);
        return kaijo[x];
    }
    static T ifact(int x){
        if (x < 0) return T(0);
        return kainv[x];
    }
    static T C(int n, int r){
        if (n < 0 || n < r || r < 0) return T(0);
        return kaijo[n] * kainv[r] * kainv[n-r];
    }
    static T P(int n, int r){
        if (n < 0 || n < r || r < 0) return T(0);
        return kaijo[n] * kainv[n-r];
    }
    static T Inv(int n){
        assert(0 < n);
        return ifact(n) * fact(n-1);
    }
    T operator()(int n, int r){ return C(n,r); }
  private:
    static vector<T> kaijo, kainv;
    static void extend(int lim){
        if ((int)kaijo.size() > lim) return ;
        int pre = kaijo.size();
        kaijo.resize(lim+1);
        kainv.resize(lim+1);
        for (int i = pre; i <= lim; i++) kaijo[i] = kaijo[i-1] * T(i);
        kainv[lim] = kaijo[lim].inv();
        for (int i = lim-1; i >= pre; i--) kainv[i] = kainv[i+1] * T(i+1);
    }
};
template<typename T>
vector<T>Binom<T>::kaijo = vector<T>(2,T(1));
template<typename T>
vector<T>Binom<T>::kainv = vector<T>(2,T(1));

} // namespace lib
#line 7 "test/math/Binomial_Coefficient.test.cpp"

using namespace lib;

using mint = dynamic_modint<-1>;
const int mx = 10'000'000;

int main(){
    int t, m; cin >> t >> m;
    mint::set_mod(m);
    Binom<mint> bnm(min(m-1,mx));
    while (t--){
        int n, k; cin >> n >> k;
        cout << bnm(n,k).val() << endl;
    }
}