結果

問題 No.269 見栄っ張りの募金活動
ユーザー MisterMister
提出日時 2020-09-10 11:07:02
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 33 ms / 5,000 ms
コード長 2,599 bytes
コンパイル時間 775 ms
コンパイル使用メモリ 71,668 KB
最終ジャッジ日時 2025-01-14 09:13:25
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

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

#include <iostream>
#include <vector>
template <int MOD>
struct ModInt {
using lint = long long;
int val;
// constructor
ModInt(lint v = 0) : val(v % MOD) {
if (val < 0) val += MOD;
};
// unary operator
ModInt operator+() const { return ModInt(val); }
ModInt operator-() const { return ModInt(MOD - val); }
ModInt inv() const { return this->pow(MOD - 2); }
// arithmetic
ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
ModInt pow(lint n) const {
auto x = ModInt(1);
auto b = *this;
while (n > 0) {
if (n & 1) x *= b;
n >>= 1;
b *= b;
}
return x;
}
// compound assignment
ModInt& operator+=(const ModInt& x) {
if ((val += x.val) >= MOD) val -= MOD;
return *this;
}
ModInt& operator-=(const ModInt& x) {
if ((val -= x.val) < 0) val += MOD;
return *this;
}
ModInt& operator*=(const ModInt& x) {
val = lint(val) * x.val % MOD;
return *this;
}
ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }
// compare
bool operator==(const ModInt& b) const { return val == b.val; }
bool operator!=(const ModInt& b) const { return val != b.val; }
bool operator<(const ModInt& b) const { return val < b.val; }
bool operator<=(const ModInt& b) const { return val <= b.val; }
bool operator>(const ModInt& b) const { return val > b.val; }
bool operator>=(const ModInt& b) const { return val >= b.val; }
// I/O
friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept {
lint v;
is >> v;
x = v;
return is;
}
friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
};
constexpr int MOD = 1000000007;
using mint = ModInt<MOD>;
void solve() {
int n, s, k;
std::cin >> n >> s >> k;
s -= k * n * (n - 1) / 2;
if (s < 0) {
std::cout << "0\n";
return;
}
std::vector<mint> dp(s + 1, 0);
dp[0] = 1;
for (int d = 1; d <= n; ++d) {
for (int x = d; x <= s; ++x) {
dp[x] += dp[x - d];
}
}
std::cout << dp[s] << "\n";
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0