test/yukicoder/117/main.test.cpp

• View this file on GitHub
• Last update: 2021-04-23 23:44:44+09:00
• Problem: https://yukicoder.me/problems/no/117
• Link: View error logs on GitHub Actions

Depends on

• Factorial table (Mylib/Combinatorics/factorial_table.cpp)
• Input tuple (Mylib/IO/input_tuple.cpp)
• Input tuples (Mylib/IO/input_tuples.cpp)
• Modint (Mylib/Number/Mint/mint.cpp)

Code

#define PROBLEM "https://yukicoder.me/problems/no/117"

#include <iostream>
#include <regex>
#include <string>
#include "Mylib/Combinatorics/factorial_table.cpp"
#include "Mylib/IO/input_tuples.cpp"
#include "Mylib/Number/Mint/mint.cpp"

namespace hl = haar_lib;

using mint           = hl::modint<1000000007>;
const static auto ft = hl::factorial_table<mint>(2000000);

int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);

  int T;
  std::cin >> T;

  std::regex re(R"((.)\((.+),(.+)\))");

  for (auto [s] : hl::input_tuples<std::string>(T)) {
    std::smatch m;
    std::regex_match(s, m, re);

    char type = m[1].str()[0];
    int N     = std::stoi(m[2].str());
    int K     = std::stoi(m[3].str());

    switch (type) {
      case 'C': std::cout << ft.C(N, K) << "\n"; break;
      case 'P': std::cout << ft.P(N, K) << "\n"; break;
      case 'H': std::cout << ft.H(N, K) << "\n"; break;
    }
  }

  return 0;
}

#line 1 "test/yukicoder/117/main.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/117"

#include <iostream>
#include <regex>
#include <string>
#line 2 "Mylib/Combinatorics/factorial_table.cpp"
#include <cassert>
#include <cstdint>
#include <vector>

namespace haar_lib {
  template <typename T>
  class factorial_table {
  public:
    using value_type = T;

  private:
    int N_;
    std::vector<T> f_table_, if_table_;

  public:
    factorial_table() {}
    factorial_table(int N) : N_(N) {
      f_table_.assign(N + 1, 1);
      if_table_.assign(N + 1, 1);

      for (int i = 1; i <= N; ++i) {
        f_table_[i] = f_table_[i - 1] * i;
      }

      if_table_[N] = f_table_[N].inv();

      for (int i = N; --i >= 0;) {
        if_table_[i] = if_table_[i + 1] * (i + 1);
      }
    }

    T factorial(int64_t i) const {
      assert(0 <= i and i <= N_);
      return f_table_[i];
    }

    T inv_factorial(int64_t i) const {
      assert(0 <= i and i <= N_);
      return if_table_[i];
    }

    T P(int64_t n, int64_t k) const {
      if (n < k or n < 0 or k < 0) return 0;
      return factorial(n) * inv_factorial(n - k);
    }

    T C(int64_t n, int64_t k) const {
      if (n < k or n < 0 or k < 0) return 0;
      return P(n, k) * inv_factorial(k);
    }

    T H(int64_t n, int64_t k) const {
      if (n == 0 and k == 0) return 1;
      return C(n + k - 1, k);
    }
  };
}  // namespace haar_lib
#line 2 "Mylib/IO/input_tuples.cpp"
#include <initializer_list>
#line 4 "Mylib/IO/input_tuples.cpp"
#include <tuple>
#include <utility>
#line 6 "Mylib/IO/input_tuple.cpp"

namespace haar_lib {
  template <typename T, size_t... I>
  static void input_tuple_helper(std::istream &s, T &val, std::index_sequence<I...>) {
    (void) std::initializer_list<int>{(void(s >> std::get<I>(val)), 0)...};
  }

  template <typename T, typename U>
  std::istream &operator>>(std::istream &s, std::pair<T, U> &value) {
    s >> value.first >> value.second;
    return s;
  }

  template <typename... Args>
  std::istream &operator>>(std::istream &s, std::tuple<Args...> &value) {
    input_tuple_helper(s, value, std::make_index_sequence<sizeof...(Args)>());
    return s;
  }
}  // namespace haar_lib
#line 8 "Mylib/IO/input_tuples.cpp"

namespace haar_lib {
  template <typename... Args>
  class InputTuples {
    struct iter {
      using value_type = std::tuple<Args...>;
      value_type value;
      bool fetched = false;
      int N, c = 0;

      value_type operator*() {
        if (not fetched) {
          std::cin >> value;
        }
        return value;
      }

      void operator++() {
        ++c;
        fetched = false;
      }

      bool operator!=(iter &) const {
        return c < N;
      }

      iter(int N) : N(N) {}
    };

    int N;

  public:
    InputTuples(int N) : N(N) {}

    iter begin() const { return iter(N); }
    iter end() const { return iter(N); }
  };

  template <typename... Args>
  auto input_tuples(int N) {
    return InputTuples<Args...>(N);
  }
}  // namespace haar_lib
#line 4 "Mylib/Number/Mint/mint.cpp"

namespace haar_lib {
  template <int32_t M>
  class modint {
    uint32_t val_;

  public:
    constexpr static auto mod() { return M; }

    constexpr modint() : val_(0) {}
    constexpr modint(int64_t n) {
      if (n >= M)
        val_ = n % M;
      else if (n < 0)
        val_ = n % M + M;
      else
        val_ = n;
    }

    constexpr auto &operator=(const modint &a) {
      val_ = a.val_;
      return *this;
    }
    constexpr auto &operator+=(const modint &a) {
      if (val_ + a.val_ >= M)
        val_ = (uint64_t) val_ + a.val_ - M;
      else
        val_ += a.val_;
      return *this;
    }
    constexpr auto &operator-=(const modint &a) {
      if (val_ < a.val_) val_ += M;
      val_ -= a.val_;
      return *this;
    }
    constexpr auto &operator*=(const modint &a) {
      val_ = (uint64_t) val_ * a.val_ % M;
      return *this;
    }
    constexpr auto &operator/=(const modint &a) {
      val_ = (uint64_t) val_ * a.inv().val_ % M;
      return *this;
    }

    constexpr auto operator+(const modint &a) const { return modint(*this) += a; }
    constexpr auto operator-(const modint &a) const { return modint(*this) -= a; }
    constexpr auto operator*(const modint &a) const { return modint(*this) *= a; }
    constexpr auto operator/(const modint &a) const { return modint(*this) /= a; }

    constexpr bool operator==(const modint &a) const { return val_ == a.val_; }
    constexpr bool operator!=(const modint &a) const { return val_ != a.val_; }

    constexpr auto &operator++() {
      *this += 1;
      return *this;
    }
    constexpr auto &operator--() {
      *this -= 1;
      return *this;
    }

    constexpr auto operator++(int) {
      auto t = *this;
      *this += 1;
      return t;
    }
    constexpr auto operator--(int) {
      auto t = *this;
      *this -= 1;
      return t;
    }

    constexpr static modint pow(int64_t n, int64_t p) {
      if (p < 0) return pow(n, -p).inv();

      int64_t ret = 1, e = n % M;
      for (; p; (e *= e) %= M, p >>= 1)
        if (p & 1) (ret *= e) %= M;
      return ret;
    }

    constexpr static modint inv(int64_t a) {
      int64_t b = M, u = 1, v = 0;

      while (b) {
        int64_t t = a / b;
        a -= t * b;
        std::swap(a, b);
        u -= t * v;
        std::swap(u, v);
      }

      u %= M;
      if (u < 0) u += M;

      return u;
    }

    constexpr static auto frac(int64_t a, int64_t b) { return modint(a) / modint(b); }

    constexpr auto pow(int64_t p) const { return pow(val_, p); }
    constexpr auto inv() const { return inv(val_); }

    friend constexpr auto operator-(const modint &a) { return modint(M - a.val_); }

    friend constexpr auto operator+(int64_t a, const modint &b) { return modint(a) + b; }
    friend constexpr auto operator-(int64_t a, const modint &b) { return modint(a) - b; }
    friend constexpr auto operator*(int64_t a, const modint &b) { return modint(a) * b; }
    friend constexpr auto operator/(int64_t a, const modint &b) { return modint(a) / b; }

    friend std::istream &operator>>(std::istream &s, modint &a) {
      s >> a.val_;
      return s;
    }
    friend std::ostream &operator<<(std::ostream &s, const modint &a) {
      s << a.val_;
      return s;
    }

    template <int N>
    static auto div() {
      static auto value = inv(N);
      return value;
    }

    explicit operator int32_t() const noexcept { return val_; }
    explicit operator int64_t() const noexcept { return val_; }
  };
}  // namespace haar_lib
#line 9 "test/yukicoder/117/main.test.cpp"

namespace hl = haar_lib;

using mint           = hl::modint<1000000007>;
const static auto ft = hl::factorial_table<mint>(2000000);

int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);

  int T;
  std::cin >> T;

  std::regex re(R"((.)\((.+),(.+)\))");

  for (auto [s] : hl::input_tuples<std::string>(T)) {
    std::smatch m;
    std::regex_match(s, m, re);

    char type = m[1].str()[0];
    int N     = std::stoi(m[2].str());
    int K     = std::stoi(m[3].str());

    switch (type) {
      case 'C': std::cout << ft.C(N, K) << "\n"; break;
      case 'P': std::cout << ft.P(N, K) << "\n"; break;
      case 'H': std::cout << ft.H(N, K) << "\n"; break;
    }
  }

  return 0;
}

Back to top page