結果
問題 | No.634 硬貨の枚数1 |
ユーザー | hiromi_ayase |
提出日時 | 2018-01-19 23:24:16 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 105 ms / 2,000 ms |
コード長 | 3,038 bytes |
コンパイル時間 | 2,398 ms |
コンパイル使用メモリ | 82,508 KB |
実行使用メモリ | 53,332 KB |
最終ジャッジ日時 | 2023-08-26 19:02:34 |
合計ジャッジ時間 | 11,670 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 69 ms
50,800 KB |
testcase_01 | AC | 69 ms
50,824 KB |
testcase_02 | AC | 69 ms
50,784 KB |
testcase_03 | AC | 70 ms
51,028 KB |
testcase_04 | AC | 70 ms
50,676 KB |
testcase_05 | AC | 68 ms
50,824 KB |
testcase_06 | AC | 70 ms
50,752 KB |
testcase_07 | AC | 70 ms
50,688 KB |
testcase_08 | AC | 69 ms
50,700 KB |
testcase_09 | AC | 69 ms
50,852 KB |
testcase_10 | AC | 68 ms
50,920 KB |
testcase_11 | AC | 68 ms
50,784 KB |
testcase_12 | AC | 70 ms
51,024 KB |
testcase_13 | AC | 69 ms
50,788 KB |
testcase_14 | AC | 82 ms
51,824 KB |
testcase_15 | AC | 101 ms
52,164 KB |
testcase_16 | AC | 96 ms
50,380 KB |
testcase_17 | AC | 98 ms
50,640 KB |
testcase_18 | AC | 96 ms
52,792 KB |
testcase_19 | AC | 95 ms
52,304 KB |
testcase_20 | AC | 97 ms
52,368 KB |
testcase_21 | AC | 101 ms
52,356 KB |
testcase_22 | AC | 88 ms
51,968 KB |
testcase_23 | AC | 99 ms
52,472 KB |
testcase_24 | AC | 69 ms
50,772 KB |
testcase_25 | AC | 70 ms
50,812 KB |
testcase_26 | AC | 69 ms
50,788 KB |
testcase_27 | AC | 69 ms
50,696 KB |
testcase_28 | AC | 70 ms
50,784 KB |
testcase_29 | AC | 72 ms
50,684 KB |
testcase_30 | AC | 70 ms
51,208 KB |
testcase_31 | AC | 69 ms
50,752 KB |
testcase_32 | AC | 68 ms
50,808 KB |
testcase_33 | AC | 69 ms
50,772 KB |
testcase_34 | AC | 79 ms
51,520 KB |
testcase_35 | AC | 94 ms
52,136 KB |
testcase_36 | AC | 98 ms
53,192 KB |
testcase_37 | AC | 98 ms
52,912 KB |
testcase_38 | AC | 81 ms
49,736 KB |
testcase_39 | AC | 101 ms
52,360 KB |
testcase_40 | AC | 99 ms
52,372 KB |
testcase_41 | AC | 98 ms
52,788 KB |
testcase_42 | AC | 99 ms
52,144 KB |
testcase_43 | AC | 95 ms
52,540 KB |
testcase_44 | AC | 67 ms
50,664 KB |
testcase_45 | AC | 71 ms
51,372 KB |
testcase_46 | AC | 82 ms
51,952 KB |
testcase_47 | AC | 99 ms
52,152 KB |
testcase_48 | AC | 68 ms
51,108 KB |
testcase_49 | AC | 81 ms
52,012 KB |
testcase_50 | AC | 103 ms
52,404 KB |
testcase_51 | AC | 82 ms
51,764 KB |
testcase_52 | AC | 69 ms
50,684 KB |
testcase_53 | AC | 68 ms
50,988 KB |
testcase_54 | AC | 68 ms
50,772 KB |
testcase_55 | AC | 104 ms
52,312 KB |
testcase_56 | AC | 101 ms
53,204 KB |
testcase_57 | AC | 104 ms
52,320 KB |
testcase_58 | AC | 104 ms
52,792 KB |
testcase_59 | AC | 100 ms
52,348 KB |
testcase_60 | AC | 102 ms
52,660 KB |
testcase_61 | AC | 103 ms
53,332 KB |
testcase_62 | AC | 101 ms
52,540 KB |
testcase_63 | AC | 102 ms
52,972 KB |
testcase_64 | AC | 101 ms
52,668 KB |
testcase_65 | AC | 105 ms
52,416 KB |
testcase_66 | AC | 103 ms
52,708 KB |
testcase_67 | AC | 102 ms
52,332 KB |
testcase_68 | AC | 103 ms
52,372 KB |
testcase_69 | AC | 102 ms
52,372 KB |
testcase_70 | AC | 101 ms
53,188 KB |
testcase_71 | AC | 102 ms
52,400 KB |
testcase_72 | AC | 89 ms
51,928 KB |
testcase_73 | AC | 101 ms
53,160 KB |
testcase_74 | AC | 100 ms
52,348 KB |
testcase_75 | AC | 101 ms
52,152 KB |
testcase_76 | AC | 70 ms
50,760 KB |
testcase_77 | AC | 68 ms
50,772 KB |
ソースコード
public class Main { private static void solve() { int n = ni(); System.out.println(f(n)); } private static int f(int n) { int m = 5000; int[] coin = new int[m]; for (int i = 1; i < m; i ++) { int c = i * (i + 1) / 2; if (c > n) { m = i; break; } else { coin[i] = c; } } boolean two = false; for (int i = 0; i < m; i ++) { if (coin[i] == n) { return 1; } if (!two) { for (int j = i; j < m; j ++) { int last = n - coin[i] - coin[j]; if (last < 0) break; else if (last == 0) two = true;; } } } return two ? 2 : 3; } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }