結果
問題 | No.269 見栄っ張りの募金活動 |
ユーザー |
![]() |
提出日時 | 2024-08-09 00:26:33 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 21 ms / 5,000 ms |
コード長 | 3,445 bytes |
コンパイル時間 | 1,733 ms |
コンパイル使用メモリ | 173,704 KB |
実行使用メモリ | 19,584 KB |
最終ジャッジ日時 | 2024-08-09 00:26:36 |
合計ジャッジ時間 | 2,840 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
ソースコード
#include <bits/stdc++.h>using namespace std;// modinttemplate<int MOD> struct Fp {long long val;constexpr Fp(long long v = 0) noexcept : val(v % MOD) {if (val < 0) val += MOD;}constexpr int getmod() const { return MOD; }constexpr Fp operator - () const noexcept {return val ? MOD - val : 0;}constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }constexpr Fp& operator += (const Fp& r) noexcept {val += r.val;if (val >= MOD) val -= MOD;return *this;}constexpr Fp& operator -= (const Fp& r) noexcept {val -= r.val;if (val < 0) val += MOD;return *this;}constexpr Fp& operator *= (const Fp& r) noexcept {val = val * r.val % MOD;return *this;}constexpr Fp& operator /= (const Fp& r) noexcept {long long a = r.val, b = MOD, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b, swap(a, b);u -= t * v, swap(u, v);}val = val * u % MOD;if (val < 0) val += MOD;return *this;}constexpr bool operator == (const Fp& r) const noexcept {return this->val == r.val;}constexpr bool operator != (const Fp& r) const noexcept {return this->val != r.val;}friend constexpr istream& operator >> (istream& is, Fp<MOD>& x) noexcept {is >> x.val;x.val %= MOD;if (x.val < 0) x.val += MOD;return is;}friend constexpr ostream& operator << (ostream& os, const Fp<MOD>& x) noexcept {return os << x.val;}friend constexpr Fp<MOD> modpow(const Fp<MOD>& r, long long n) noexcept {if (n == 0) return 1;if (n < 0) return modpow(modinv(r), -n);auto t = modpow(r, n / 2);t = t * t;if (n & 1) t = t * r;return t;}friend constexpr Fp<MOD> modinv(const Fp<MOD>& r) noexcept {long long a = r.val, b = MOD, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b, swap(a, b);u -= t * v, swap(u, v);}return Fp<MOD>(u);}};// partition numbertemplate<class mint> struct PartionNumber {vector<vector<mint>> val;constexpr PartionNumber() {}constexpr PartionNumber(int MAX_N, int MAX_K) noexcept {init(MAX_N, MAX_K);}constexpr void init(int MAX_N, int MAX_K) noexcept {val.assign(MAX_N + 1, vector<mint>(MAX_K + 1, 0));val[0][0] = 1;for (int n = 0; n <= MAX_N; ++n) {for (int k = 1; k <= MAX_K; ++k) {val[n][k] += val[n][k - 1];if (n >= k) val[n][k] += val[n - k][k];}}}constexpr mint get(long long n, long long k) const noexcept {if (n < 0 || k <= 0 || n >= val.size() || k >= val[0].size()) return 0;return val[n][k];}};const int MOD = 1000000007;using mint = Fp<MOD>;int main() {long long N, S, K;cin >> N >> S >> K;PartionNumber<mint> pn(S, N);cout << pn.get(S - N * (N - 1) / 2 * K, N) << endl;}