結果

問題 No.269 見栄っ張りの募金活動
ユーザー tutuztutuz
提出日時 2018-11-24 15:19:07
言語 Java21
(openjdk 21)
結果
AC  
実行時間 86 ms / 5,000 ms
コード長 3,291 bytes
コンパイル時間 2,752 ms
コンパイル使用メモリ 78,208 KB
実行使用メモリ 49,696 KB
最終ジャッジ日時 2024-07-16 02:10:29
合計ジャッジ時間 4,282 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
36,916 KB
testcase_01 AC 49 ms
37,176 KB
testcase_02 AC 50 ms
37,476 KB
testcase_03 AC 58 ms
37,684 KB
testcase_04 AC 71 ms
41,432 KB
testcase_05 AC 51 ms
36,876 KB
testcase_06 AC 51 ms
37,196 KB
testcase_07 AC 86 ms
49,696 KB
testcase_08 AC 48 ms
37,132 KB
testcase_09 AC 69 ms
41,704 KB
testcase_10 AC 50 ms
37,264 KB
testcase_11 AC 61 ms
38,544 KB
testcase_12 AC 68 ms
40,996 KB
testcase_13 AC 59 ms
38,332 KB
testcase_14 AC 52 ms
37,452 KB
testcase_15 AC 60 ms
38,400 KB
testcase_16 AC 69 ms
40,732 KB
testcase_17 AC 57 ms
37,428 KB
testcase_18 AC 74 ms
45,624 KB
testcase_19 AC 70 ms
39,092 KB
testcase_20 AC 54 ms
37,688 KB
testcase_21 AC 51 ms
37,680 KB
testcase_22 AC 57 ms
37,648 KB
testcase_23 AC 51 ms
37,324 KB
testcase_24 AC 55 ms
37,156 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