結果

問題 No.269 見栄っ張りの募金活動
ユーザー tutuztutuz
提出日時 2018-11-24 15:19:07
言語 Java21
(openjdk 21)
結果
AC  
実行時間 73 ms / 5,000 ms
コード長 3,291 bytes
コンパイル時間 3,140 ms
コンパイル使用メモリ 74,640 KB
実行使用メモリ 60,292 KB
最終ジャッジ日時 2023-09-23 01:37:38
合計ジャッジ時間 5,016 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
49,676 KB
testcase_01 AC 44 ms
49,928 KB
testcase_02 AC 44 ms
49,620 KB
testcase_03 AC 50 ms
49,784 KB
testcase_04 AC 60 ms
53,072 KB
testcase_05 AC 45 ms
50,040 KB
testcase_06 AC 44 ms
49,736 KB
testcase_07 AC 73 ms
60,292 KB
testcase_08 AC 43 ms
49,728 KB
testcase_09 AC 62 ms
53,048 KB
testcase_10 AC 44 ms
49,464 KB
testcase_11 AC 55 ms
51,080 KB
testcase_12 AC 60 ms
53,084 KB
testcase_13 AC 57 ms
51,504 KB
testcase_14 AC 48 ms
49,728 KB
testcase_15 AC 56 ms
51,100 KB
testcase_16 AC 59 ms
53,264 KB
testcase_17 AC 51 ms
49,512 KB
testcase_18 AC 65 ms
55,932 KB
testcase_19 AC 57 ms
51,172 KB
testcase_20 AC 46 ms
49,504 KB
testcase_21 AC 47 ms
49,768 KB
testcase_22 AC 51 ms
49,516 KB
testcase_23 AC 46 ms
49,632 KB
testcase_24 AC 48 ms
49,368 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int N = in.nextInt(), S = in.nextInt(), K = in.nextInt();
			int[][] p = partition(S+1, N+1, MOD);
			int num = S - K * N * (N-1) / 2;
			if (num < 0) {
				out.println(0);
				return;
			}

			long ans = p[N][num];
			out.println(ans);
		}

		int[][] partition(int sum, int part, final int mod) {
			int[][] dp = new int[part + 1][sum + 1];
			dp[0][0] = 1;
			for (int i = 1; i <= part; i++) {
				for (int j = 0; j <= sum; j++) {
					dp[i][j] = dp[i - 1][j] + (j < i ? 0 : dp[i][j - i]);
					dp[i][j] %= MOD;
				}
			}
			return dp;
		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}

		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}

		public long[] nextLongArray1Index(int n) {
			long[] res = new long[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextLong();
			}
			return res;
		}

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}
	}

}
0