結果
問題 | No.117 組み合わせの数 |
ユーザー |
![]() |
提出日時 | 2020-11-24 11:55:11 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 203 ms / 5,000 ms |
コード長 | 4,775 bytes |
コンパイル時間 | 1,847 ms |
コンパイル使用メモリ | 165,728 KB |
実行使用メモリ | 26,632 KB |
最終ジャッジ日時 | 2024-07-23 18:26:47 |
合計ジャッジ時間 | 3,047 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 1 |
ソースコード
#include <bits/stdc++.h>//#include <atcoder/all>//using namespace atcoder;#pragma GCC target ("avx2")#pragma GCC optimization ("O3")#pragma GCC optimization ("unroll-loops")const double pi = 3.141592653589793238462643383279;using namespace std;//typedef//------------------------------------------typedef vector<int> VI;typedef vector<VI> VVI;typedef vector<string> VS;typedef pair<int, int> PII;typedef pair<long long, long long> PLL;typedef pair<int, PII> TIII;typedef long long LL;typedef unsigned long long ULL;typedef vector<LL> VLL;typedef vector<VLL> VVLL;//container util//------------------------------------------#define ALL(a) (a).begin(), (a).endf()#define RALL(a) (a).rbegin(), (a).rend()#define PB push_back#define MP make_pair#define SZ(a) int((a).size())#define SQ(a) ((a) * (a))#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).endf(); ++i)#define EXIST(s, e) ((s).find(e) != (s).endf())#define SORT(c) sort((c).begin(), (c).endf())//repetition//------------------------------------------#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)#define REP(i, n) FOR(i, 0, n)#define MOD 1000000007#define rep(i, a, b) for (int i = a; i < (b); ++i)#define trav(a, x) for (auto &a : x)#define all(x) x.begin(), x.end()typedef long long ll;typedef pair<int, int> pii;typedef vector<int> vi;#define chmin(x, y) x = min(x, y)#define chmax(x, y) x = max(x, y)const double EPS = 1e-9, PI = acos(-1);//ここから編集typedef string::const_iterator State;template< int mod >struct ModInt {int x;ModInt() : x(0) {}ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}ModInt operator-() const { return ModInt(-x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;while(b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return ModInt(u);}ModInt pow(int64_t n) const {ModInt ret(1), mul(x);while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}friend ostream &operator<<(ostream &os, const ModInt &p) {return os << p.x;}friend istream &operator>>(istream &is, ModInt &a) {int64_t t;is >> t;a = ModInt< mod >(t);return (is);}static int get_mod() { return mod; }};using modint = ModInt< 1000000007 >;template< typename T >struct Combination {vector< T > _fact, _rfact, _inv;Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {_fact[0] = _rfact[sz] = _inv[0] = 1;for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;_rfact[sz] /= _fact[sz];for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];}inline T fact(int k) const { return _fact[k]; }inline T rfact(int k) const { return _rfact[k]; }inline T inv(int k) const { return _inv[k]; }T P(int n, int r) const {if(r < 0 || n < r) return 0;return fact(n) * rfact(n - r);}T C(int p, int q) const {if(q < 0 || p < q) return 0;return fact(p) * rfact(q) * rfact(p - q);}T H(int n, int r) const {if(n < 0 || r < 0) return (0);return r == 0 ? 1 : C(n + r - 1, r);}};int main(){cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(10);int t; cin >> t;Combination<modint> comb(2010101);while(t--){string s; cin >> s;char t = s[0];int k=0, c = 0;int idx = 2;while(idx<s.size() && isdigit(s[idx])){k = k*10 + s[idx]-'0';idx++;}idx++;while(idx<s.size() && isdigit(s[idx])){c = c*10 + s[idx]-'0';idx++;}//cout << k << " " << c << endl;if(t == 'P'){cout << comb.P(k, c) << endl;}else if(t == 'C'){cout << comb.C(k, c) << endl;}else{cout << comb.H(k, c) << endl;}}return 0;}