結果
問題 | No.2023 Tiling is Fun |
ユーザー |
|
提出日時 | 2022-07-30 00:50:32 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 57 ms / 2,000 ms |
コード長 | 1,859 bytes |
コンパイル時間 | 2,029 ms |
コンパイル使用メモリ | 195,192 KB |
最終ジャッジ日時 | 2025-01-30 16:26:14 |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
#include <bits/stdc++.h>//#include <atcoder/all>using namespace std;//using namespace atcoder;using ll = long long;using vll = vector<ll>;using vvll = vector<vll>;using vvvll = vector<vvll>;using vvvvll = vector<vvvll>;using vb = vector<bool>;using vvb = vector<vb>;using vvvb = vector<vvb>;using vvvvb = vector<vvvb>;using vd = vector<double>;using vvd = vector<vd>;using vvvd = vector<vvd>;#define all(A) A.begin(),A.end()#define ALL(A) A.begin(),A.end()#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;template<class T>bool chmax(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p < q) {p = q;return 1;}else {return 0;}}template<class T>bool chmin(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p > q) {p = q;return 1;}else {return 0;}}ll gcd(ll(a), ll(b)) {if (b == 0)return a;ll c = a;while (a % b != 0) {c = a % b;a = b;b = c;}return b;}vector<ll> fact, factinv, inv;ll mod = 998244353;void prenCkModp(ll n) {fact.resize(n + 5);factinv.resize(n + 5);inv.resize(n + 5);fact.at(0) = fact.at(1) = 1;factinv.at(0) = factinv.at(1) = 1;inv.at(1) = 1;for (ll i = 2; i < n + 5; i++) {fact.at(i) = (fact.at(i - 1) * i) % mod;inv.at(i) = mod - (inv.at(mod % i) * (mod / i)) % mod;factinv.at(i) = (factinv.at(i - 1) * inv.at(i)) % mod;}}ll nCk(ll n, ll k) {if (n < k) return 0;return fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod;}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll A,B;cin>>A>>B;prenCkModp(A+B);cout<<nCk(A+B-2,A-1)<<endl;}