結果
| 問題 | No.117 組み合わせの数 |
| ユーザー |
|
| 提出日時 | 2018-01-21 19:54:20 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,517 bytes |
| コンパイル時間 | 2,952 ms |
| コンパイル使用メモリ | 216,776 KB |
| 実行使用メモリ | 34,836 KB |
| 最終ジャッジ日時 | 2024-12-25 21:46:57 |
| 合計ジャッジ時間 | 4,051 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
ソースコード
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"
using namespace std;
typedef long long int ll;
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
return uniform_int_distribution<ll>(l, h)(randdev);
}
#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
class MaiScanner {
public:
template<typename T> void input_integer(T& var) {
var = 0; T sign = 1;
int cc = getchar_unlocked();
for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
if (cc == '-') sign = -1;
for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
var = (var << 3) + (var << 1) + cc - '0';
var = var * sign;
}
inline int c() { return getchar_unlocked(); }
inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; }
inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; }
inline MaiScanner& operator>>(string& var) {
int cc = getchar_unlocked();
for (; !isvisiblechar(cc); cc = getchar_unlocked());
for (; isvisiblechar(cc); cc = getchar_unlocked())
var.push_back(cc);
return *this;
}
template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
public:
template<typename T>
void output_integer(T var) {
if (var == 0) { putchar_unlocked('0'); return; }
if (var < 0)
putchar_unlocked('-'),
var = -var;
char stack[32]; int stack_p = 0;
while (var)
stack[stack_p++] = '0' + (var % 10),
var /= 10;
while (stack_p)
putchar_unlocked(stack[--stack_p]);
}
inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; }
inline MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; }
inline MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; }
inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
inline MaiPrinter& operator<<(const string& str) {
const char* p = str.c_str();
const char* l = p + str.size();
while (p < l) putchar_unlocked(*p++);
return *this;
}
template<typename IT> void join(IT begin, IT end, char sep = '\n') { for (auto it = begin; it != end; ++it) *this << *it << sep; }
};
}
MaiScanner scanner;
MaiPrinter printer;
template<typename T> inline T gcd(T a, T b) { while (b) { T t = a % b; a = b; b = t; }return a; }
template<typename T> inline T lcm(T a, T b) { return a * b / gcd(a, b); }
// MEMO : 逆元...pow_md(n,MOD-2,MOD)
template<typename T> T pow_md(T x, T p, T mod = MD) {
T y = 1; x = x % mod;
while (0<p) {
if (p & 1)
y = (y*x) % mod;
x = (x*x) % mod;
p >>= 1;
}
return y;
}
template<typename T> T fact_md(T n, T mod = MD) {
T p = 1; for (; 1<n; p = (p*n--) % mod); return p;
}
template<typename T> T nPr_md(T n, T r, T mod = MD) {
T p = 1; for (r=n-r; r<n; p = (p*n--) % mod); return p;
}
template<typename T> T nCr_md(T n, T r, T mod = MD) {
if (n / 2 < r) return nCr_md(n, n - r);
T p = 1; for (; 0<r; r--)
p = (((p*(n - r + 1)) % mod)*pow_md(r, mod - 2)) % mod;
return p;
}
template<typename T> T nHr_md(T n, T r, T mod = MD) {
return nCr_md(n - 1 + r, n - 1, mod);
}
const ll HIGH = 2000000;
ll muls_d[HIGH+10];
ll divs_d[HIGH+10];
ll *muls = muls_d + 1;
ll *divs = divs_d + 1;
inline ll my_nPk(ll n, ll k) {
return (muls[n] * divs[(n - k)]) % MD;
}
inline ll my_nCk(ll n, ll k) {
assert(n < HIGH && k < HIGH);
return (((muls[n] * divs[(n - k)]) % MD) * divs[k]) % MD;
}
inline ll my_nHr(ll n, ll r) {
return my_nCk(n - 1 + r, n - 1);
}
int main() {
muls[-1] = muls[0] = muls[1] = divs[-1] = divs[0] = divs[1] = 1;
iterate(i, 2ll, HIGH+5) {
muls[i] = (muls[i - 1] * i) % MD;
divs[i] = (divs[i - 1] * pow_md(i, MD - 2)) % MD;
}
// iterate(y, 1ll, 5) {
// iterate(x, y, 6) {
// cout << " " << make_pair(x,y) << endl;
// cout << make_pair(my_nCk(x, y),nCr_md(x, y)) << endl;
// cout << make_pair(my_nPk(x, y),nPr_md(x, y)) << endl;
// cout << make_pair(my_nHr(x, y),nHr_md(x, y)) << endl;
// assert(my_nCk(x, y) == nCr_md(x, y));
// assert(my_nPk(x, y) == nPr_md(x, y));
// assert(my_nHr(x, y) == nHr_md(x, y));
// }
// }
// return 0;
ll q;
cin >> q;
repeat(i, q) {
char c;
ll n, k;
scanf("\n%c(%lld,%lld)", &c, &n, &k);
// cerr << c << make_pair(n, k) << endl;
if (c == 'H') {
printer << my_nHr(n, k) << '\n';
}
else if (c == 'C') {
printer << (n < k ? 0 : my_nCk(n, k)) << '\n';
}
else {
printer << (n < k ? 0 : my_nPk(n, k)) << '\n';
}
}
return 0;
}