結果
問題 | No.287 場合の数 |
ユーザー | しらっ亭 |
提出日時 | 2015-10-09 23:34:29 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 66 ms / 5,000 ms |
コード長 | 5,647 bytes |
コンパイル時間 | 2,403 ms |
コンパイル使用メモリ | 80,996 KB |
実行使用メモリ | 37,644 KB |
最終ジャッジ日時 | 2024-11-07 23:56:31 |
合計ジャッジ時間 | 4,785 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 64 ms
37,272 KB |
testcase_01 | AC | 52 ms
37,012 KB |
testcase_02 | AC | 54 ms
37,000 KB |
testcase_03 | AC | 66 ms
37,144 KB |
testcase_04 | AC | 62 ms
37,152 KB |
testcase_05 | AC | 64 ms
36,908 KB |
testcase_06 | AC | 53 ms
36,756 KB |
testcase_07 | AC | 60 ms
37,248 KB |
testcase_08 | AC | 63 ms
37,420 KB |
testcase_09 | AC | 61 ms
37,140 KB |
testcase_10 | AC | 65 ms
37,572 KB |
testcase_11 | AC | 57 ms
37,024 KB |
testcase_12 | AC | 63 ms
37,424 KB |
testcase_13 | AC | 54 ms
37,236 KB |
testcase_14 | AC | 58 ms
37,148 KB |
testcase_15 | AC | 63 ms
37,040 KB |
testcase_16 | AC | 61 ms
37,140 KB |
testcase_17 | AC | 62 ms
37,436 KB |
testcase_18 | AC | 58 ms
37,188 KB |
testcase_19 | AC | 66 ms
37,264 KB |
testcase_20 | AC | 61 ms
36,928 KB |
testcase_21 | AC | 62 ms
37,644 KB |
testcase_22 | AC | 65 ms
36,840 KB |
testcase_23 | AC | 60 ms
37,496 KB |
testcase_24 | AC | 58 ms
37,180 KB |
ソースコード
package problems287; import java.io.BufferedReader; import java.io.ByteArrayOutputStream; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintStream; import java.io.PrintWriter; import java.io.StringReader; import java.util.Arrays; public class Main { int N; long[][] dp; public void run() throws IOException { N = io.nextInt(); dp = new long[9][6 * N + 1]; for (int i = 0; i < 9; i++) { Arrays.fill(dp[i], -1); } long ans = rec(8, 6 * N); System.out.println(ans); } private long rec(int p, int n) { if (p == 0) { if (n == 0) { return 1; } else { return 0; } } if (dp[p][n] != -1) { return dp[p][n]; } long a = 0; for (int i = 0; i <= N && i <= n; i++) { a += rec(p - 1, n - i); } dp[p][n] = a; return a; } // @formatter:off private static final int mod = (int) 1e9 + 7; final IOFast io = new IOFast(); void main() throws IOException { try { run(); } catch (RuntimeException e) { e.printStackTrace(); } finally { io.out.flush(); } } public static void main(String[] args) throws IOException { new Main().main(); } public static String dtos(double x, int n) { StringBuilder sb = new StringBuilder(); if (x < 0) { sb.append('-'); x = -x; } x += Math.pow(10, -n) / 2; sb.append((long) x); sb.append("."); x -= (long) x; for (int i = 0; i < n; i++) { x *= 10; sb.append((int) x); x -= (int) x; } return sb.toString(); } public static class IOFast { private BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); private PrintWriter out = new PrintWriter(System.out); void setStringIn(String input) throws IOException { in.close(); in = new BufferedReader(new StringReader(input)); } void setStringOut(ByteArrayOutputStream output) throws IOException { System.out.flush(); System.setOut(new PrintStream(output)); } void setStringIO(String input, ByteArrayOutputStream output) throws IOException { setStringIn(input); setStringOut(output); } private static int pos, readLen; private static final char[] buffer = new char[1024 * 8]; private static char[] str = new char[500*8*2]; private static boolean[] isDigit = new boolean[256]; private static boolean[] isSpace = new boolean[256]; private static boolean[] isLineSep = new boolean[256]; static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; } public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new RuntimeException(); } } return buffer[pos++]; } public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } } int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(RuntimeException e) { ; } return len; } public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(RuntimeException e) { ; } return Arrays.copyOf(str, len); } public String nextString() throws IOException { return new String(next()); } public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); } public double nextDouble() throws IOException { return Double.parseDouble(nextString()); } public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; } public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; } public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } } // @formatter:on }