template/debug.hpp

• View this file on GitHub
• Last update: 2023-05-04 19:50:45+09:00
• Include: #include "template/debug.hpp"

Depends on

• number_theory/mod_int.hpp
• number_theory/utils.hpp

Code

#pragma once

#include <array>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <type_traits>
#include <utility>
#include <vector>
#include <tuple>

#include "../number_theory/mod_int.hpp"

template <typename T, std::enable_if_t<std::is_integral_v<T>> * = nullptr>
void debug(T x) {
    std::cerr << x;
}

template <typename T, std::enable_if_t<std::is_floating_point_v<T>> * = nullptr>
void debug(T x) {
    std::cerr << x;
}

void debug(bool b) {
    if (b) {
        std::cerr << "true";
    } else {
        std::cerr << "false";
    }
}

template <typename T>
void debug(const std::vector<T> &x);

template <unsigned mod>
void debug(const ModInt<mod> &x) {
    std::cerr << x;
}

void debug(const std::string &s) {
    std::cerr << '"' << s << '"';
}

template <typename T, typename U>
void debug(const std::pair<T, U> &p) {
    std::cerr << '(';
    debug(p.first);
    std::cerr << ", ";
    debug(p.second);
    std::cerr << ')';
}

template <std::size_t cur, typename... Args>
void tuple_debug_inner(const std::tuple<Args...> &t) {
    std::cerr << std::get<cur>(t);
    if constexpr (cur + 1 != sizeof...(Args)) {
        std::cerr << ", ";
        tuple_debug_inner<cur + 1, Args...>(t);
    }
}

template <typename... Args>
void debug(const std::tuple<Args...> &t) {
    std::cerr << '(';
    tuple_debug_inner<0, Args...>(t);
    std::cerr << ')';
}

template <typename T, std::size_t s>
void debug(const std::array<T, s> &arr) {
    std::cerr << '[';
    for (std::size_t i = 0; i < s; ++i) {
        debug(arr[i]);
        if (i + 1 != s) {
            std::cerr << ", ";
        }
    }
    std::cerr << ']';
}

template <typename K, typename V>
void debug(const std::map<K, V> &mp) {
    std::cerr << '{';
    for (const auto [k, v] : mp) {
        std::cerr << ' ';
        debug(k);
        std::cerr << ':';
        debug(v);
    }
    std::cerr << " }";
}

template <typename T>
void debug(const std::set<T> &st) {
    std::cerr << '{';
    for (const T &ele : st) {
        std::cerr << ' ';
        debug(ele);
    }
    std::cerr << " }";
}

template <typename T>
void debug(std::queue<T> que) {
    std::cerr << '[';
    while (!que.empty()) {
        T ele = que.front();
        que.pop();
        debug(ele);
        if (!que.empty()) {
            std::cerr << ' ';
        }
    }
    std::cerr << ']';
}

template <typename T>
void debug(const std::vector<T> &v) {
    std::cerr << '[';
    for (std::size_t i = 0; i < v.size(); ++i) {
        debug(v[i]);
        if (i + 1 != v.size()) {
            std::cerr << ", ";
        }
    }
    std::cerr << ']';
}

template <typename T, typename Container, typename Comp>
void debug(std::priority_queue<T, Container, Comp> que) {
    std::cerr << '[';
    while (!que.empty()) {
        T ele = que.top();
        que.pop();
        debug(ele);
        if (!que.empty()) {
            std::cerr << ' ';
        }
    }
    std::cerr << ']';
}

template <typename T>
void debug(std::stack<T> sta) {
    std::cerr << '[';
    while (!sta.empty()) {
        T ele = sta.top();
        sta.pop();
        debug(ele);
        if (!sta.empty()) {
            std::cerr << ' ';
        }
    }
    std::cerr << ']';
}

template <typename T>
void debug(std::deque<T> dq) {
    std::cerr << '[';
    while (!dq.empty()) {
        T ele = dq.front();
        dq.pop_front();
        debug(ele);
        if (!dq.empty()) {
            std::cerr << ' ';
        }
    }
    std::cerr << ']';
}

#define DBG(x)                   \
    do {                         \
        std::cerr << #x << ": "; \
        debug(x);                \
        std::cerr << std::endl;  \
    } while (false)

#line 2 "template/debug.hpp"

#include <array>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <type_traits>
#include <utility>
#include <vector>
#include <tuple>

#line 2 "number_theory/mod_int.hpp"

#include <cassert>
#line 6 "number_theory/mod_int.hpp"

#line 2 "number_theory/utils.hpp"

constexpr bool is_prime(unsigned n) {
    if (n == 0 || n == 1) {
        return false;
    }
    for (unsigned i = 2; i * i <= n; ++i) {
        if (n % i == 0) {
            return false;
        }
    }
    return true;
}

constexpr unsigned mod_pow(unsigned x, unsigned y, unsigned mod) {
    unsigned ret = 1, self = x;
    while (y != 0) {
        if (y & 1) {
            ret = (unsigned) ((unsigned long long) ret * self % mod);
        }
        self = (unsigned) ((unsigned long long) self * self % mod);
        y /= 2;
    }
    return ret;
}

template <unsigned mod>
constexpr unsigned primitive_root() {
    static_assert(is_prime(mod), "`mod` must be a prime number.");
    if (mod == 2) {
        return 1;
    }

    unsigned primes[32] = {};
    int it = 0;
    {
        unsigned m = mod - 1;
        for (unsigned i = 2; i * i <= m; ++i) {
            if (m % i == 0) {
                primes[it++] = i;
                while (m % i == 0) {
                    m /= i;
                }
            }
        }
        if (m != 1) {
            primes[it++] = m;
        }
    }
    for (unsigned i = 2; i < mod; ++i) {
        bool ok = true;
        for (int j = 0; j < it; ++j) {
            if (mod_pow(i, (mod - 1) / primes[j], mod) == 1) {
                ok = false;
                break;
            }
        }
        if (ok)
            return i;
    }
    return 0;
}

// y >= 1
template <typename T>
constexpr T safe_mod(T x, T y) {
    x %= y;
    if (x < 0) {
        x += y;
    }
    return x;
}

// y != 0
template <typename T>
constexpr T floor_div(T x, T y) {
    if (y < 0) {
        x *= -1;
        y *= -1;
    }
    if (x >= 0) {
        return x / y;
    } else {
        return -((-x + y - 1) / y);
    }
}

// y != 0
template <typename T>
constexpr T ceil_div(T x, T y) {
    if (y < 0) {
        x *= -1;
        y *= -1;
    }
    if (x >= 0) {
        return (x + y - 1) / y;
    } else {
        return -(-x / y);
    }
}
#line 8 "number_theory/mod_int.hpp"

template <unsigned mod>
class ModInt {
    static_assert(mod != 0, "`mod` must not be equal to 0.");
    static_assert(
        mod < (1u << 31),
        "`mod` must be less than (1u << 31) = 2147483648.");

    unsigned val;

public:
    static constexpr unsigned get_mod() {
        return mod;
    }
    
    constexpr ModInt() : val(0) {}
    template <typename T, std::enable_if_t<std::is_signed_v<T>> * = nullptr>
    constexpr ModInt(T x) : val((unsigned) ((long long) x % (long long) mod + (x < 0 ? mod : 0))) {}
    template <typename T, std::enable_if_t<std::is_unsigned_v<T>> * = nullptr>
    constexpr ModInt(T x) : val((unsigned) (x % mod)) {}

    static constexpr ModInt raw(unsigned x) {
        ModInt<mod> ret;
        ret.val = x;
        return ret;
    }

    constexpr unsigned get_val() const {
        return val;
    }

    constexpr ModInt operator+() const {
        return *this;
    }
    constexpr ModInt operator-() const {
        return ModInt<mod>(0u) - *this;
    }

    constexpr ModInt &operator+=(const ModInt &rhs) {
        val += rhs.val;
        if (val >= mod)
            val -= mod;
        return *this;
    }
    constexpr ModInt &operator-=(const ModInt &rhs) {
        if (val < rhs.val)
            val += mod;
        val -= rhs.val;
        return *this;
    }
    constexpr ModInt &operator*=(const ModInt &rhs) {
        val = (unsigned long long)val * rhs.val % mod;
        return *this;
    }
    constexpr ModInt &operator/=(const ModInt &rhs) {
        val = (unsigned long long)val * rhs.inv().val % mod;
        return *this;
    }

    friend constexpr ModInt operator+(const ModInt &lhs, const ModInt &rhs) {
        return ModInt<mod>(lhs) += rhs;
    }
    friend constexpr ModInt operator-(const ModInt &lhs, const ModInt &rhs) {
        return ModInt<mod>(lhs) -= rhs;
    }
    friend constexpr ModInt operator*(const ModInt &lhs, const ModInt &rhs) {
        return ModInt<mod>(lhs) *= rhs;
    }
    friend constexpr ModInt operator/(const ModInt &lhs, const ModInt &rhs) {
        return ModInt<mod>(lhs) /= rhs;
    }

    constexpr ModInt pow(unsigned long long x) const {
        ModInt<mod> ret = ModInt<mod>::raw(1);
        ModInt<mod> self = *this;
        while (x != 0) {
            if (x & 1)
                ret *= self;
            self *= self;
            x >>= 1;
        }
        return ret;
    }
    constexpr ModInt inv() const {
        static_assert(is_prime(mod), "`mod` must be a prime number.");
        assert(val != 0);
        return this->pow(mod - 2);
    }

    friend std::istream &operator>>(std::istream &is, ModInt<mod> &x) {
        long long val;
        is >> val;
        x.val = val % mod + (val < 0 ? mod : 0);
        return is;
    }

    friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &x) {
        os << x.val;
        return os;
    }

    friend bool operator==(const ModInt &lhs, const ModInt &rhs) {
        return lhs.val == rhs.val;
    }
    
    friend bool operator!=(const ModInt &lhs, const ModInt &rhs) {
        return lhs.val != rhs.val;
    }
};

[[maybe_unused]] constexpr unsigned mod998244353 = 998244353;
[[maybe_unused]] constexpr unsigned mod1000000007 = 1000000007;

#line 16 "template/debug.hpp"

template <typename T, std::enable_if_t<std::is_integral_v<T>> * = nullptr>
void debug(T x) {
    std::cerr << x;
}

template <typename T, std::enable_if_t<std::is_floating_point_v<T>> * = nullptr>
void debug(T x) {
    std::cerr << x;
}

void debug(bool b) {
    if (b) {
        std::cerr << "true";
    } else {
        std::cerr << "false";
    }
}

template <typename T>
void debug(const std::vector<T> &x);

template <unsigned mod>
void debug(const ModInt<mod> &x) {
    std::cerr << x;
}

void debug(const std::string &s) {
    std::cerr << '"' << s << '"';
}

template <typename T, typename U>
void debug(const std::pair<T, U> &p) {
    std::cerr << '(';
    debug(p.first);
    std::cerr << ", ";
    debug(p.second);
    std::cerr << ')';
}

template <std::size_t cur, typename... Args>
void tuple_debug_inner(const std::tuple<Args...> &t) {
    std::cerr << std::get<cur>(t);
    if constexpr (cur + 1 != sizeof...(Args)) {
        std::cerr << ", ";
        tuple_debug_inner<cur + 1, Args...>(t);
    }
}

template <typename... Args>
void debug(const std::tuple<Args...> &t) {
    std::cerr << '(';
    tuple_debug_inner<0, Args...>(t);
    std::cerr << ')';
}

template <typename T, std::size_t s>
void debug(const std::array<T, s> &arr) {
    std::cerr << '[';
    for (std::size_t i = 0; i < s; ++i) {
        debug(arr[i]);
        if (i + 1 != s) {
            std::cerr << ", ";
        }
    }
    std::cerr << ']';
}

template <typename K, typename V>
void debug(const std::map<K, V> &mp) {
    std::cerr << '{';
    for (const auto [k, v] : mp) {
        std::cerr << ' ';
        debug(k);
        std::cerr << ':';
        debug(v);
    }
    std::cerr << " }";
}

template <typename T>
void debug(const std::set<T> &st) {
    std::cerr << '{';
    for (const T &ele : st) {
        std::cerr << ' ';
        debug(ele);
    }
    std::cerr << " }";
}

template <typename T>
void debug(std::queue<T> que) {
    std::cerr << '[';
    while (!que.empty()) {
        T ele = que.front();
        que.pop();
        debug(ele);
        if (!que.empty()) {
            std::cerr << ' ';
        }
    }
    std::cerr << ']';
}

template <typename T>
void debug(const std::vector<T> &v) {
    std::cerr << '[';
    for (std::size_t i = 0; i < v.size(); ++i) {
        debug(v[i]);
        if (i + 1 != v.size()) {
            std::cerr << ", ";
        }
    }
    std::cerr << ']';
}

template <typename T, typename Container, typename Comp>
void debug(std::priority_queue<T, Container, Comp> que) {
    std::cerr << '[';
    while (!que.empty()) {
        T ele = que.top();
        que.pop();
        debug(ele);
        if (!que.empty()) {
            std::cerr << ' ';
        }
    }
    std::cerr << ']';
}

template <typename T>
void debug(std::stack<T> sta) {
    std::cerr << '[';
    while (!sta.empty()) {
        T ele = sta.top();
        sta.pop();
        debug(ele);
        if (!sta.empty()) {
            std::cerr << ' ';
        }
    }
    std::cerr << ']';
}

template <typename T>
void debug(std::deque<T> dq) {
    std::cerr << '[';
    while (!dq.empty()) {
        T ele = dq.front();
        dq.pop_front();
        debug(ele);
        if (!dq.empty()) {
            std::cerr << ' ';
        }
    }
    std::cerr << ']';
}

#define DBG(x)                   \
    do {                         \
        std::cerr << #x << ": "; \
        debug(x);                \
        std::cerr << std::endl;  \
    } while (false)

Back to top page