algo/math/combo.h

• View this file on GitHub
• Last update: 2024-12-11 17:25:04-05:00

Depends on

• algo/common.h
• algo/math/common.h

Verified with

• verify/math/combo.test.cpp

Code

#pragma once
#include "algo/common.h"
#include "algo/math/common.h"

namespace algo::math {

template <typename T>
T fact(int n) {
    static std::vector<T> F(MAXN);
    static bool init = false;
    if (!init) {
        F[0] = T(1);
        for (int i = 1; i < MAXN; i++) {
            F[i] = F[i - 1] * T(i);
        }
        init = true;
    }
    return F[n];
}
template <typename T>
T inv_fact(int n) {
    static std::vector<T> F(MAXN);
    static bool init = false;
    if (!init) {
        int t = std::min(T::mod(), MAXN) - 1;
        F[t] = T(1) / fact<T>(t);
        for (int i = t - 1; i >= 0; i--) {
            F[i] = F[i + 1] * T(i + 1);
        }
        init = true;
    }
    return F[n];
}
template <typename T>
T cmb(int n, int r) {
    assert(n < MAXN);
    if (r < 0 || r > n) {
        return T(0);
    } else {
        return fact<T>(n) * inv_fact<T>(r) * inv_fact<T>(n - r);
    }
}
template <typename T>
T perm(int n, int r) {
    assert(n < MAXN);
    if (r < 0 || r > n) {
        return T(0);
    } else {
        return fact<T>(n) * inv_fact<T>(n - r);
    }
}

} // namespace algo::math

#line 2 "algo/common.h"
#ifndef PREPROCESS
#include <bits/stdc++.h>
#endif

namespace algo {}

#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#line 3 "algo/math/common.h"

#ifdef ALGO_MAXN
const int MAXN = ALGO_MAXN;
#else
const int MAXN = 1 << 19;
#endif

namespace algo::math {

constexpr int64_t safe_mod(int64_t x, int64_t m) {
    x %= m;
    if (x < 0) x += m;
    return x;
}

// Returns (x ** n) % m
constexpr int64_t pow_mod_constexpr(int64_t x, int64_t n, int m) {
    assert(0 <= n);
    assert(1 <= m);
    if (m == 1) return 0;
    uint _m = (uint)(m);
    uint64_t r = 1;
    uint64_t y = safe_mod(x, m);
    while (n) {
        if (n & 1) r = (r * y) % _m;
        y = (y * y) % _m;
        n >>= 1;
    }
    return r;
}

struct barrett {
    explicit barrett(uint64_t _m) : m(_m), im(-1ULL / _m) {
        assert(1 <= _m);
    }
    uint64_t mod() {
        return m;
    };
    uint64_t reduce(uint64_t a) {
        uint64_t q = (uint64_t)((__uint128_t(im) * a) >> 64);
        uint64_t r = a - q * m;
        return r - (r >= m) * m;
    }

private:
    uint64_t m, im;
};

constexpr int64_t c_div(int64_t a, int64_t b) {
    return a / b + ((a ^ b) > 0 && a % b);
}
constexpr int64_t f_div(int64_t a, int64_t b) {
    return a / b - ((a ^ b) < 0 && a % b);
}

auto bpow(auto const &x, auto n, auto const &one, auto op) {
    if (n == 0) {
        return one;
    } else {
        auto t = bpow(x, n / 2, one, op);
        t = op(t, t);
        if (n % 2) {
            t = op(t, x);
        }
        return t;
    }
}
auto bpow(auto x, auto n, auto ans) {
    return bpow(x, n, ans, std::multiplies{});
}
template <typename T>
T bpow(T const &x, auto n) {
    return bpow(x, n, T(1));
}

// Returns a pair(g, x) s.t. g = gcd(a, n), xa = g (mod n), 0 <= x < n/g
// If r > 1 then a is not invertible mod n
constexpr std::pair<int64_t, int64_t> inv_gcd(int64_t a, int64_t n) {
    a = safe_mod(a, n);
    if (a == 0) return {n, 0};

    int64_t t = 0, newt = 1;
    int64_t r = n, newr = a;

    while (newr) {
        int64_t quotient = r / newr;
        r -= newr * quotient;
        t -= newt * quotient;

        std::swap(r, newr);
        std::swap(t, newt);
    }
    if (t < 0) t += n / r;
    return {r, t};
}

} // namespace algo::math
#line 4 "algo/math/combo.h"

namespace algo::math {

template <typename T>
T fact(int n) {
    static std::vector<T> F(MAXN);
    static bool init = false;
    if (!init) {
        F[0] = T(1);
        for (int i = 1; i < MAXN; i++) {
            F[i] = F[i - 1] * T(i);
        }
        init = true;
    }
    return F[n];
}
template <typename T>
T inv_fact(int n) {
    static std::vector<T> F(MAXN);
    static bool init = false;
    if (!init) {
        int t = std::min(T::mod(), MAXN) - 1;
        F[t] = T(1) / fact<T>(t);
        for (int i = t - 1; i >= 0; i--) {
            F[i] = F[i + 1] * T(i + 1);
        }
        init = true;
    }
    return F[n];
}
template <typename T>
T cmb(int n, int r) {
    assert(n < MAXN);
    if (r < 0 || r > n) {
        return T(0);
    } else {
        return fact<T>(n) * inv_fact<T>(r) * inv_fact<T>(n - r);
    }
}
template <typename T>
T perm(int n, int r) {
    assert(n < MAXN);
    if (r < 0 || r > n) {
        return T(0);
    } else {
        return fact<T>(n) * inv_fact<T>(n - r);
    }
}

} // namespace algo::math

Back to top page