結果

問題 No.117 組み合わせの数
ユーザー Konton7Konton7
提出日時 2020-05-05 21:22:37
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 536 ms / 5,000 ms
コード長 5,055 bytes
コンパイル時間 2,589 ms
コンパイル使用メモリ 201,892 KB
最終ジャッジ日時 2025-01-10 07:02:20
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 1
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()
const int mod = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const ll inf = 1e18;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";
template <typename T>
void show1dvec(const vector<T> &v)
{
if (v.size() == 0)
return;
int n = v.size() - 1;
rep(i, n) cout << v[i] << wsp;
cout << v[n] << rt;
return;
}
template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
int n = v.size();
rep(i, n) show1dvec(v[i]);
}
template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
int n = v.size();
rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
return;
}
template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
int n = v.size();
rep(i, n)
{
t.push_back(v[i].first);
s.push_back(v[i].second);
}
return;
}
template <typename T>
void maxvec(vector<T> &v)
{
T s = v[0];
int n = v.size();
rep(i, n - 1)
{
if (s > v[i + 1])
{
v[i + 1] = s;
}
s = v[i + 1];
}
}
template <typename T, typename S>
bool myfind(T t, S s)
{
return find(t.cbegin(), t.cend(), s) != t.cend();
}
bool check(int y, int x, int h, int w)
{
return 0 <= y && y < h && 0 <= x && x < w;
}
template <typename T>
vector<T> cumsum(const vector<T> &v)
{
T s = 0;
vector<T> ret;
rep(i, v.size())
{
s += v[i];
s %= mod;
ret.emplace_back(s);
}
return ret;
}
bool iskadomatsu(int a, int b, int c)
{
return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}
VS split(string s, char c)
{
VS ret;
string part;
s += c;
rep(i, s.length())
{
if (s[i] == c)
{
ret.emplace_back(part);
part = "";
}
else if (s[i] != c)
{
part += s[i];
}
}
return ret;
}
string removezero(string &s)
{
string ret;
for (auto z : s)
if (z != '0')
ret += z;
return ret;
}
ll sumdigit(ll x)
{
ll ans{0};
while (x > 0)
{
ans += x % 10;
x /= 10;
}
return ans;
}
template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod)
{
ll ret = 1, r = p;
while (q)
{
if (q % 2)
ret *= r, ret %= mod;
r = (r * r) % mod, q /= 2;
}
return ret % mod;
}
ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list)
{
if (a < b)
return 0;
ll ret = frac_list[a];
ret *= frac_inv_list[b];
ret %= mod;
ret *= frac_inv_list[a - b];
ret %= mod;
return ret;
}
ll perm(int a, int b, const VL &frac_list, const VL &frac_inv_list)
{
if (a < b)
return 0;
ll ret = frac_list[a];
ret *= frac_inv_list[a - b];
ret %= mod;
return ret;
}
ll multset(int a, int b, const VL &frac_list, const VL &frac_inv_list)
{
if (a == 0 && b == 0)
return 1;
return comb(a + b - 1, b, frac_list, frac_inv_list);
}
int main()
{
// cin.tie(0);
// ios::sync_with_stdio(false);
#ifdef DEBUG
cout << "DEBUG MODE" << endl;
ifstream in("input.txt"); //for debug
cin.rdbuf(in.rdbuf()); //for debug
#endif
const int intmax = 2000010;
VL frac_list(intmax + 1, 1), frac_inv_list(intmax + 1, 1);
rep(i, intmax)
{
frac_list[i + 1] *= frac_list[i] * (i + 1);
frac_list[i + 1] %= mod;
frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
frac_inv_list[i + 1] %= mod;
}
int q, a, b, status;
cin >> q;
string s, sa, sb;
rep(i, q)
{
cin >> s;
sa = sb = "";
status = 0;
rep2(j, 1, s.length())
{
if (s[j] == '(')
status++;
else if (s[j] == ',')
status++;
else if (s[j] == ')')
status++;
else if (status == 1)
sa += s[j];
else if (status == 2)
sb += s[j];
}
a = stoi(sa), b = stoi(sb);
if (s[0] == 'C')
cout << comb(a, b, frac_list, frac_inv_list) << rt;
else if (s[0] == 'P')
cout << perm(a, b, frac_list, frac_inv_list) << rt;
else if (s[0] == 'H')
cout << multset(a, b, frac_list, frac_inv_list) << rt;
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0