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

• 問題: No.269 見栄っ張りの募金活動
• ユーザー: Gyuuto
• 提出日時: 2015-11-25 17:45:06
• 言語: C++11 (gcc 11.4.0)
• 結果: WA
• 実行時間: -
• コード長: 2,225 bytes
• コンパイル時間: 672 ms
• コンパイル使用メモリ: 82,640 KB
• 実行使用メモリ: 19,072 KB
• 最終ジャッジ日時: 2024-09-13 17:23:43
• 合計ジャッジ時間: 1,590 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	2 ms; 6,944 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	4 ms; 6,940 KB
testcase_04	WA	-
testcase_05	AC	2 ms; 6,944 KB
testcase_06	AC	3 ms; 6,944 KB
testcase_07	WA	-
testcase_08	AC	1 ms; 6,940 KB
testcase_09	AC	13 ms; 10,624 KB
testcase_10	AC	2 ms; 6,940 KB
testcase_11	WA	-
testcase_12	AC	11 ms; 9,088 KB
testcase_13	AC	5 ms; 6,940 KB
testcase_14	WA	-
testcase_15	AC	5 ms; 6,940 KB
testcase_16	AC	10 ms; 8,448 KB
testcase_17	AC	4 ms; 6,944 KB
testcase_18	AC	17 ms; 13,312 KB
testcase_19	AC	6 ms; 6,944 KB
testcase_20	AC	2 ms; 6,944 KB
testcase_21	WA	-
testcase_22	AC	3 ms; 6,940 KB
testcase_23	AC	2 ms; 6,940 KB
testcase_24	AC	2 ms; 6,940 KB

ソースコード

// Standard I/O
#include <iostream>
#include <sstream>
#include <cstdio>
// Standard Library
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
// Template Class
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
// Container Control
#include <algorithm>

using namespace std;

#define rep( i, n ) for( int i = 0; i < n; ++i )
#define irep( i, n ) for( int i = n-1; i >= 0; --i )
#define reep( i, s, n ) for ( int i = s; i < n; ++i )
#define ireep( i, n, s ) for ( int i = n-1; i >= s; --i )
#define foreach(itr, x) for( typeof(x.begin()) itr = x.begin(); itr != x.end(); ++itr)

#define mp( a, b ) make_pair( a, b )
#define pb( a ) push_back( a )
#define all( v ) v.begin(), v.end()
#define fs first
#define sc second
#define vc vector

// for visualizer.html
double SCALE = 1.0;
double OFFSET_X = 0.0;
double OFFSET_Y = 0.0;
#define LINE(x,y,a,b) cerr << "line(" << SCALE*(x) + OFFSET_X << ","	\
	<< SCALE*(y) + OFFSET_Y << ","										\
	<< SCALE*(a) + OFFSET_X << ","										\
	<< SCALE*(b) + OFFSET_Y << ")" << endl;
#define CIRCLE(x,y,r) cerr << "circle(" << SCALE*(x) + OFFSET_X << ","	\
	<< SCALE*(y) + OFFSET_Y << ","										\
	<< SCALE*(r) << ")" << endl;

typedef long long ll;
typedef complex<double> Point;

typedef pair<int, int> pii;
typedef pair<int, pii> ipii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector< vector<int> > vii;
typedef vector< vector<double> > vdd;

typedef vector<int>::iterator vi_itr;

const int IINF = 1 << 28;
const ll LINF = 1ll << 50;
const double INF = 1e30;
const double EPS = 1e-10;
const double PI = acos(-1.0);

// Direction : L U R D
const int dx[] = { -1, 0, 1, 0};
const int dy[] = { 0, -1, 0, 1 };

int N, S, K;
ll dp[110][20010];
const ll MOD = 1.0E9 + 7;

int main()
{
	cin >> N >> S >> K;

	rep(i, S+1){
		if(i*(N-1) > S) continue;
		dp[0][i*N] = 1;
	}
	
	reep(i, 1, N){
		rep(j, S+1){
			dp[i][j] = ((dp[i][j] + 
						 (j - K*(N-i) < 0 ? 0 : dp[i-1][j - K*(N-i)]))%MOD
						+ (N-i < 0 ? 0 : dp[i][j - (N-i)]))%MOD;
		}
	}

	// rep(i, N+1){
	// 	rep(j, S+1) cout << dp[i][j] << " ";
	// 	cout << endl;
	// }
	
	cout << dp[N-1][S] << endl;
}