#444709 (C++14) No.269 見栄っ張りの募金活動

• 問題: No.269 見栄っ張りの募金活動
• ユーザー: 👑 CleyL
• 提出日時: 2020-03-16 17:52:47
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 948 ms / 5,000 ms
• コード長: 2,243 bytes
• コンパイル時間: 475 ms
• コンパイル使用メモリ: 64,432 KB
• 実行使用メモリ: 11,480 KB
• 最終ジャッジ日時: 2024-11-28 02:56:51
• 合計ジャッジ時間: 4,251 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 22

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
#include <iostream>
#include <ctime>
using namespace std;
const int mod = 1000000007;
template <int mod>
struct ModInt{
  int n;
  ModInt():n(0){}
  ModInt(int n_):n(n_ >= 0 ? n_%mod : mod - ((-n_)%mod) ){}
  ModInt &operator+=(const ModInt &p){
    if((n+=p.n) >= mod)n-=mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p){
    n+=mod-p.n;
    if(n >= mod)n-=mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p){
    n = (int) ((1LL*n*p.n)%mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p){
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const {return ModInt(-n);}
  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 n==p.n;}
  bool operator!=(const ModInt &p) const {return n!=p.n;}
  ModInt inverse() const {
    int a = n,b = mod,u = 1,v = 0;
    while(b){
      int t = a/b;
      a -= t*b; swap(a,b);
      u -= t*v; swap(u,v);
    }
    return ModInt(u);
  }
  ModInt pow(int64_t z) const {
    ModInt ret(1),mul(n);
    while(z > 0){
      if(z & 1) ret *= mul;
      mul *= mul;
      z >>= 1;
    }
    return ret;
  }
  friend ostream &operator<<(ostream &os, const ModInt &p){
    return os << p.n;
  }
  friend istream &operator>>(istream &is, ModInt &a){
    int64_t t;
    is >> t;
    a = ModInt<mod> (t);
    return (is);
  }
};
using mint = ModInt<mod>;
mint dp[101][20001];
int main(){
    //int ti = clock();
    int n,s,k;cin>>n>>s>>k;
    if(((n+(n-1))/2)*((n+(n-1))/2+1)/2*k > s){
        cout << 0 << endl;
        return 0;
    }
    s -= ((n+(n-1))/2)*((n+(n-1))/2+1)/2*k;
    dp[0][0] = 1;
    for(int i = 0; n > i; i++){
        for(int j = 0; s >= j; j++){
            if(dp[i][j] != 0){
                for(int l = 0; s >= j+l*(n-i); l++){
                    dp[i+1][j+l*(n-i)]+=dp[i][j];
                }
            }
        }
        //cout << i << endl;
    }
    // for(int i = 0; n >= i; i++){
    //  for(int j = 0; s >= j; j++){
    //      cout << dp[i][j] << " ";
    //  }
    //  cout << endl;
    // }
    cout << dp[n][s] << endl;
    //cout << (double)ti/CLOCKS_PER_SEC << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX