結果
| 問題 | No.117 組み合わせの数 |
| ユーザー |
 hirayuu_yc
|
| 提出日時 | 2024-05-10 17:41:07 |
| 言語 | C++23(gcc13) (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 334 ms / 5,000 ms |
| コード長 | 14,760 bytes |
| コンパイル時間 | 6,550 ms |
| コンパイル使用メモリ | 280,968 KB |
| 実行使用メモリ | 39,696 KB |
| 最終ジャッジ日時 | 2024-05-10 17:41:16 |
| 合計ジャッジ時間 | 4,690 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
ソースコード
#line 1 "Verify/verify-yuki/117.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/117"
#line 2 "Math/ModCombination.hpp"
#include <cstdint>
#include <vector>
template <typename T>
struct ModCombination {
std::vector<T> fact = {1}, rev{1};
void resize(uint32_t sz) {
sz++;
if (fact.size() >= sz) return;
uint32_t before = fact.size();
fact.resize(sz);
rev.resize(sz);
for (uint32_t i = before; i < sz; i++) {
fact[i] = fact[i - 1] * i;
rev[i] = rev[i - 1] / i;
}
}
T comb(int32_t n, int32_t k) {
if (n < 0 || k < 0 || n < k) return 0;
resize(n);
return fact[n] * rev[n - k] * rev[k];
}
T perm(int32_t n, int32_t k) {
if (n < 0 || k < 0 || n < k) return 0;
resize(n);
return fact[n] * rev[n - k];
}
T multi_comb(int32_t n, int32_t k) {
if (k == 0) return 1;
return comb(n + k - 1, k);
}
};
#line 3 "Modint/Modint.hpp"
#include <iostream>
template <uint64_t Mod>
struct Modint {
uint64_t x;
constexpr Modint() noexcept { x = 0; }
constexpr Modint(int64_t val) noexcept {
x = (val < 0 ? val % (int64_t)(Mod) + Mod : val % Mod);
}
inline uint64_t _get_mod(uint64_t val) noexcept {
const static uint64_t m_inv = (-1ULL) / Mod + 1;
uint64_t ret = ((unsigned __int128)(val)*m_inv) >> 64;
uint64_t pro = ret * Mod;
return (val - pro + (val < pro ? Mod : 0));
}
friend std::ostream &operator<<(std::ostream &os, Modint &b) {
return os << b.x;
}
friend std::istream &operator>>(std::istream &is, Modint &b) {
return is >> b.x;
}
constexpr uint64_t val() noexcept { return x; }
constexpr Modint operator+() noexcept { return (*this); }
constexpr Modint operator-() noexcept { return Modint() - (*this); }
constexpr Modint operator+(const Modint rhs) noexcept {
return Modint(*this) += rhs;
}
constexpr Modint operator-(const Modint rhs) noexcept {
return Modint(*this) -= rhs;
}
constexpr Modint operator*(const Modint rhs) noexcept {
return Modint(*this) *= rhs;
}
constexpr Modint operator/(const Modint rhs) noexcept {
return Modint(*this) /= rhs;
}
constexpr Modint &operator+=(const Modint rhs) noexcept {
x += rhs.x;
if (x >= Mod) x -= Mod;
return *this;
}
constexpr Modint &operator-=(const Modint rhs) noexcept {
if (x < rhs.x) x += Mod;
x -= rhs.x;
return *this;
}
constexpr Modint &operator*=(const Modint rhs) noexcept {
x = _get_mod(x * rhs.x);
return *this;
}
constexpr bool operator==(Modint rhs) noexcept { return x == rhs.x; }
constexpr bool operator!=(Modint rhs) noexcept { return x != rhs.x; }
constexpr Modint &operator/=(Modint rhs) noexcept {
return (*this) *= rhs.inv();
}
constexpr Modint inv() noexcept { return (*this).pow(Mod - 2); }
constexpr Modint pow(uint64_t x) noexcept {
Modint ret = 1;
Modint bin = (*this);
while (x) {
if (x & 1) ret *= bin;
bin *= bin;
x >>= 1;
}
return ret;
}
static uint64_t get_mod() noexcept { return Mod; }
};
template <int64_t id>
struct ArbitraryModint {
uint64_t x;
static uint64_t &mod() noexcept {
static uint64_t Mod = 0;
return Mod;
}
constexpr ArbitraryModint() noexcept { x = 0; }
constexpr ArbitraryModint(int64_t val) noexcept {
x = (val < 0 ? val % (int64_t)(get_mod()) + get_mod()
: val % get_mod());
}
inline uint64_t _get_mod(uint64_t val) noexcept {
const static uint64_t m_inv = (-1ULL) / get_mod() + 1;
uint64_t ret = ((unsigned __int128)(val)*m_inv) >> 64;
uint64_t pro = ret * get_mod();
return (val - pro + (val < pro ? get_mod() : 0));
}
friend std::ostream &operator<<(std::ostream &os, ArbitraryModint &b) {
return os << b.x;
}
friend std::istream &operator>>(std::istream &is, ArbitraryModint &b) {
return is >> b.x;
}
constexpr uint64_t val() noexcept { return x; }
constexpr ArbitraryModint operator+() noexcept { return (*this); }
constexpr ArbitraryModint operator-() noexcept {
return ArbitraryModint() - (*this);
}
constexpr ArbitraryModint operator+(const ArbitraryModint rhs) noexcept {
return ArbitraryModint(*this) += rhs;
}
constexpr ArbitraryModint operator-(const ArbitraryModint rhs) noexcept {
return ArbitraryModint(*this) -= rhs;
}
constexpr ArbitraryModint operator*(const ArbitraryModint rhs) noexcept {
return ArbitraryModint(*this) *= rhs;
}
constexpr ArbitraryModint operator/(const ArbitraryModint rhs) noexcept {
return ArbitraryModint(*this) /= rhs;
}
constexpr ArbitraryModint &operator+=(const ArbitraryModint rhs) noexcept {
x += rhs.x;
if (x >= get_mod()) x -= get_mod();
return *this;
}
constexpr ArbitraryModint &operator-=(const ArbitraryModint rhs) noexcept {
if (x < rhs.x) x += get_mod();
x -= rhs.x;
return *this;
}
constexpr ArbitraryModint &operator*=(const ArbitraryModint rhs) noexcept {
x = _get_mod(x * rhs.x);
return *this;
}
constexpr ArbitraryModint &operator/=(ArbitraryModint rhs) noexcept {
return (*this) *= rhs.inv();
}
constexpr bool operator==(ArbitraryModint rhs) noexcept {
return x == rhs.x;
}
constexpr bool operator!=(ArbitraryModint rhs) noexcept {
return x != rhs.x;
}
constexpr ArbitraryModint inv() noexcept {
return (*this).pow(get_mod() - 2);
}
constexpr ArbitraryModint pow(uint64_t x) noexcept {
ArbitraryModint ret = 1;
ArbitraryModint bin = (*this);
while (x) {
if (x & 1) ret *= bin;
bin *= bin;
x >>= 1;
}
return ret;
}
static void set_mod(const uint64_t x) noexcept { mod() = x; }
static uint64_t get_mod() noexcept { return mod(); }
};
template <uint64_t N>
inline void scan(Modint<N> &a) {
std::cin >> a.x;
}
template <int64_t id>
inline void scan(ArbitraryModint<id> &a) {
std::cin >> a.x;
}
template <uint64_t N>
inline void print(Modint<N> a) {
std::cout << a.x;
}
template <int64_t id>
inline void print(ArbitraryModint<id> a) {
std::cout << a.x;
}
#line 2 "Template/Template.hpp"
#include <bits/stdc++.h>
using namespace std;
#line 8 "Template/InOut.hpp"
inline void scan() {}
inline void scan(int &a) { std::cin >> a; }
inline void scan(unsigned &a) { std::cin >> a; }
inline void scan(long &a) { std::cin >> a; }
inline void scan(long long &a) { std::cin >> a; }
inline void scan(unsigned long long &a) { std::cin >> a; }
inline void scan(char &a) { std::cin >> a; }
inline void scan(float &a) { std::cin >> a; }
inline void scan(double &a) { std::cin >> a; }
inline void scan(long double &a) { std::cin >> a; }
inline void scan(std::vector<bool> &vec) {
for (int32_t i = 0; i < vec.size(); i++) {
int a;
scan(a);
vec[i] = a;
}
}
inline void scan(std::string &a) { std::cin >> a; }
template <class T>
inline void scan(std::vector<T> &vec);
template <class T, size_t size>
inline void scan(std::array<T, size> &vec);
template <class T, class L>
inline void scan(std::pair<T, L> &p);
template <class T, size_t size>
inline void scan(T (&vec)[size]);
template <class T>
inline void scan(std::vector<T> &vec) {
for (auto &i : vec) scan(i);
}
template <class T>
inline void scan(std::deque<T> &vec) {
for (auto &i : vec) scan(i);
}
template <class T, size_t size>
inline void scan(std::array<T, size> &vec) {
for (auto &i : vec) scan(i);
}
template <class T, class L>
inline void scan(std::pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size>
inline void scan(T (&vec)[size]) {
for (auto &i : vec) scan(i);
}
template <class T>
inline void scan(T &a) {
std::cin >> a;
}
inline void in() {}
template <class Head, class... Tail>
inline void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
inline void print() { std::cout << ' '; }
inline void print(const bool &a) { std::cout << a; }
inline void print(const int &a) { std::cout << a; }
inline void print(const unsigned &a) { std::cout << a; }
inline void print(const long &a) { std::cout << a; }
inline void print(const long long &a) { std::cout << a; }
inline void print(const unsigned long long &a) { std::cout << a; }
inline void print(const char &a) { std::cout << a; }
inline void print(const char a[]) { std::cout << a; }
inline void print(const float &a) { std::cout << a; }
inline void print(const double &a) { std::cout << a; }
inline void print(const long double &a) { std::cout << a; }
inline void print(const std::string &a) {
for (auto &&i : a) print(i);
}
template <class T>
inline void print(const std::vector<T> &vec);
template <class T, size_t size>
inline void print(const std::array<T, size> &vec);
template <class T, class L>
inline void print(const std::pair<T, L> &p);
template <class T, size_t size>
inline void print(const T (&vec)[size]);
template <class T>
inline void print(const std::vector<T> &vec) {
if (vec.empty()) return;
print(vec[0]);
for (auto i = vec.begin(); ++i != vec.end();) {
std::cout << ' ';
print(*i);
}
}
template <class T>
inline void print(const std::deque<T> &vec) {
if (vec.empty()) return;
print(vec[0]);
for (auto i = vec.begin(); ++i != vec.end();) {
std::cout << ' ';
print(*i);
}
}
template <class T, size_t size>
inline void print(const std::array<T, size> &vec) {
print(vec[0]);
for (auto i = vec.begin(); ++i != vec.end();) {
std::cout << ' ';
print(*i);
}
}
template <class T, class L>
inline void print(const std::pair<T, L> &p) {
print(p.first);
std::cout << ' ';
print(p.second);
}
template <class T, size_t size>
inline void print(const T (&vec)[size]) {
print(vec[0]);
for (auto i = vec; ++i != end(vec);) {
std::cout << ' ';
print(*i);
}
}
template <class T>
inline void print(const T &a) {
std::cout << a;
}
inline void out() { std::cout << '\n'; }
template <class T>
inline void out(const T &t) {
print(t);
std::cout << '\n';
}
template <class Head, class... Tail>
inline void out(const Head &head, const Tail &...tail) {
print(head);
std::cout << ' ';
out(tail...);
}
inline void Yes(bool i = true) { out(i ? "Yes" : "No"); }
inline void No(bool i = true) { out(i ? "No" : "Yes"); }
struct IOsetup {
IOsetup() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout << std::setprecision(10);
}
} iosetup;
#line 1 "Template/Macro.hpp"
#define _overload3(_1, _2, _3, name, ...) name
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _rep1(i, n) for (ll i = 0; i < (n); i++)
#define _rep2(i, a, b) for (ll i = (a); i < (b); i++)
#define _rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) _overload4(__VA_ARGS__, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(i, n) for (ll i = (n); i-- > 0;)
#define _rrep2(i, a, b) for (ll i = (b); i-- > (a);)
#define rrep(...) _overload3(__VA_ARGS__, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, ...) for (auto&& i : __VA_ARGS__)
#define all(i) std::begin(i), std::end(i)
#define rall(i) std::rbegin(i), std::rend(i)
#define len(x) ((int)(x).size())
#define fi first
#define se second
#define uniq(x) x.erase(unique(all(x)), std::end(x))
#define vec(type, name, ...) vector<type> name(__VA_ARGS__);
#define vv(type, name, h, ...) \
std::vector<std::vector<type>> name(h, std::vector<type>(__VA_ARGS__));
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define LD(...) \
ld __VA_ARGS__; \
in(__VA_ARGS__)
#define VEC(type, name, size) \
std::vector<type> name(size); \
in(name)
#define VV(type, name, h, w) \
std::vector<std::vector<type>> name(h, std::vector<type>(w)); \
in(name)
#line 8 "Template/Util.hpp"
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pll = std::pair<ll, ll>;
using pii = std::pair<int, int>;
using vl = std::vector<ll>;
using vll = std::vector<ll>;
using pdd = std::pair<ld, ld>;
using tuplis = std::array<ll, 3>;
template <class T>
using pq = std::priority_queue<T, std::vector<T>, std::greater<T>>;
const ll LINF = 1LL << 60;
constexpr int INF = INT_MAX >> 1;
constexpr ll MINF = 1LL << 40;
constexpr ld DINF = std::numeric_limits<ld>::infinity();
constexpr int MODD = 1000000007;
constexpr int MOD = 998244353;
constexpr ld EPS = 1e-9;
constexpr ld PI = 3.1415926535897932;
const ll four[] = {0, 1, 0, -1, 0};
const ll eight[] = {0, 1, 1, 0, -1, -1, 1, -1, 0};
template <class T>
bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
template <class T>
ll sum(const T &a) {
return accumulate(std::begin(a), std::end(a), 0LL);
}
template <class T>
ld dsum(const T &a) {
return accumulate(std::begin(a), std::end(a), 0.0L);
}
template <class T>
auto min(const T &a) {
return *min_element(std::begin(a), std::end(a));
}
template <class T>
auto max(const T &a) {
return *max_element(std::begin(a), std::end(a));
}
#line 5 "Verify/verify-yuki/117.test.cpp"
using mint = Modint<MODD>;
void solve() {
LL(T);
ModCombination<mint> comb;
rep(i, T) {
STR(S);
ll N = 0, K = 0;
bool flg = false;
each(j, S) {
if (0 <= j - '0' && j - '0' <= 9) {
if (flg) {
K *= 10;
K += j - '0';
} else {
N *= 10;
N += j - '0';
}
} else if (j == ',') {
flg = true;
}
}
if (S[0] == 'C')
out(comb.comb(N, K));
else if (S[0] == 'P')
out(comb.perm(N, K));
else if (S[0] == 'H')
out(comb.multi_comb(N, K));
}
}
int main() { solve(); }