結果

問題 No.741 AscNumber(Easy)
ユーザー tutuztutuz
提出日時 2018-10-06 15:20:57
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,057 ms / 2,000 ms
コード長 3,118 bytes
コンパイル時間 2,090 ms
コンパイル使用メモリ 77,704 KB
実行使用メモリ 137,024 KB
最終ジャッジ日時 2024-10-12 13:49:48
合計ジャッジ時間 19,580 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
37,144 KB
testcase_01 AC 54 ms
37,360 KB
testcase_02 AC 54 ms
37,356 KB
testcase_03 AC 53 ms
37,064 KB
testcase_04 AC 55 ms
37,436 KB
testcase_05 AC 53 ms
37,468 KB
testcase_06 AC 53 ms
37,412 KB
testcase_07 AC 54 ms
37,284 KB
testcase_08 AC 54 ms
37,192 KB
testcase_09 AC 53 ms
37,492 KB
testcase_10 AC 54 ms
36,912 KB
testcase_11 AC 54 ms
37,064 KB
testcase_12 AC 55 ms
37,200 KB
testcase_13 AC 54 ms
37,308 KB
testcase_14 AC 54 ms
36,956 KB
testcase_15 AC 55 ms
37,064 KB
testcase_16 AC 54 ms
37,448 KB
testcase_17 AC 55 ms
37,412 KB
testcase_18 AC 56 ms
37,492 KB
testcase_19 AC 54 ms
37,412 KB
testcase_20 AC 56 ms
36,992 KB
testcase_21 AC 55 ms
37,200 KB
testcase_22 AC 58 ms
37,396 KB
testcase_23 AC 57 ms
37,352 KB
testcase_24 AC 55 ms
37,416 KB
testcase_25 AC 55 ms
37,192 KB
testcase_26 AC 56 ms
37,212 KB
testcase_27 AC 54 ms
37,400 KB
testcase_28 AC 56 ms
37,200 KB
testcase_29 AC 56 ms
37,124 KB
testcase_30 AC 56 ms
37,432 KB
testcase_31 AC 56 ms
37,272 KB
testcase_32 AC 55 ms
37,124 KB
testcase_33 AC 55 ms
37,356 KB
testcase_34 AC 57 ms
37,412 KB
testcase_35 AC 1,057 ms
132,452 KB
testcase_36 AC 476 ms
79,560 KB
testcase_37 AC 552 ms
102,384 KB
testcase_38 AC 543 ms
102,252 KB
testcase_39 AC 458 ms
78,624 KB
testcase_40 AC 598 ms
102,344 KB
testcase_41 AC 924 ms
124,400 KB
testcase_42 AC 526 ms
102,224 KB
testcase_43 AC 407 ms
75,492 KB
testcase_44 AC 765 ms
122,224 KB
testcase_45 AC 821 ms
123,140 KB
testcase_46 AC 962 ms
127,928 KB
testcase_47 AC 208 ms
54,728 KB
testcase_48 AC 959 ms
128,056 KB
testcase_49 AC 828 ms
122,868 KB
testcase_50 AC 155 ms
50,380 KB
testcase_51 AC 450 ms
75,356 KB
testcase_52 AC 1,027 ms
136,776 KB
testcase_53 AC 1,036 ms
137,024 KB
testcase_54 AC 1,024 ms
135,900 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();
			long[][] dp = new long[n+1][10];
			dp[n][0] = 1;

			for (int i = n; i > 0; i--) {
				for (int j = 0; j < 10; j++) {
					for (int k = 0; k <= j; k++) {
						dp[i-1][j] += dp[i][k];
						dp[i-1][j] %= MOD;
					}
				}
			}

			long ans = 0;
			for (int i = 0; i < 10; i++) {
				ans += dp[0][i] % MOD;
			}

			out.println(ans % MOD);

		}
	}

	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