結果
問題 | No.117 組み合わせの数 |
ユーザー |
![]() |
提出日時 | 2020-05-11 17:21:06 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 123 ms / 5,000 ms |
コード長 | 4,937 bytes |
コンパイル時間 | 1,330 ms |
コンパイル使用メモリ | 167,984 KB |
実行使用メモリ | 35,200 KB |
最終ジャッジ日時 | 2024-07-18 14:40:06 |
合計ジャッジ時間 | 1,975 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 1 |
ソースコード
#include<bits/stdc++.h>#define rep(i,a,b) for(int i=a;i<b;i++)#define rrep(i,a,b) for(int i=a;i>=b;i--)#define fore(i,a) for(auto &i:a)#define all(x) (x).begin(),(x).end()#pragma GCC optimize ("-O3")using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }//---------------------------------------------------------------------------------------------------template<int MOD> struct ModInt {static const int Mod = MOD; unsigned x; ModInt() : x(0) { }ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }int get() const { return (int)x; }ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }ModInt operator+(ModInt that) const { return ModInt(*this) += that; }ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }return ModInt(u); }bool operator==(ModInt that) const { return x == that.x; }bool operator!=(ModInt that) const { return x != that.x; }ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }};template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;Comb() {fac.resize(FAC_MAX, 1); ifac.resize(FAC_MAX, 1);rep(i, 1, FAC_MAX) fac[i] = fac[i - 1] * i;rep(i, 1, FAC_MAX) ifac[i] = T(1) / fac[i];}T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;return aCb(n + k - 1, k); }}; // nHk = (n+k-1)Cktypedef ModInt<998244353> mint;/*---------------------------------------------------------------------------------------------------∧_∧∧_∧ (´<_` ) Welcome to My Coding Space!( ´_ゝ`) / ⌒i/ \ | |/ / ̄ ̄ ̄ ̄/ |__(__ニつ/ _/ .| .|____\/____/ (u ⊃---------------------------------------------------------------------------------------------------*/ll mod = 1000000007;//---------------------------------------------------------------------------------------------------ll f[2010101], rf[2010101];ll inv(ll x) {ll res = 1;ll k = mod - 2;ll y = x;while (k) {if (k & 1) res = (res * y) % mod;y = (y * y) % mod;k /= 2;}return res;}void init() {f[0] = 1;rep(i, 1, 2010101) f[i] = (f[i - 1] * i) % mod;rf[2010101 - 1] = inv(f[2010101 - 1]);rrep(i, 2010101 - 2, 0) rf[i] = (rf[i + 1] * (i + 1)) % mod;}//---------------------------------------------------------------------------------------------------ll C(int n, int k) {if (k < 0 || n < k) return 0;ll a = f[n]; // = n!ll b = rf[n - k]; // = (n-k)!ll c = rf[k]; // = k!ll bc = (b * c) % mod;return (a * bc) % mod;}ll P(int n, int k) {if (k < 0 || n < k) return 0;ll a = f[n]; // = n!ll b = rf[n - k]; // = (n-k)!return (a * b) % mod;}ll H(int n, int k) {if (n == 0 && k == 0) return 1;return C(n + k - 1, k);}//---------------------------------------------------------------------------------------------------void _main() {init();int T;cin >> T;rep(t, 0, T) {string s; cin >> s;char c; int a, b;sscanf(s.c_str(), "%c(%d,%d)", &c, &a, &b);int ans;if (c == 'C') ans = C(a, b);else if (c == 'P') ans = P(a, b);else ans = H(a, b);printf("%d\n", ans);}}