結果
問題 | No.1114 足し算盆に返らず |
ユーザー | hiromi_ayase |
提出日時 | 2020-07-18 02:41:48 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 384 ms / 2,000 ms |
コード長 | 2,513 bytes |
コンパイル時間 | 8,309 ms |
コンパイル使用メモリ | 77,796 KB |
実行使用メモリ | 57,040 KB |
最終ジャッジ日時 | 2023-08-20 16:22:44 |
合計ジャッジ時間 | 19,985 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 384 ms
56,512 KB |
testcase_01 | AC | 208 ms
56,540 KB |
testcase_02 | AC | 197 ms
56,440 KB |
testcase_03 | AC | 200 ms
57,040 KB |
testcase_04 | AC | 217 ms
56,688 KB |
testcase_05 | AC | 181 ms
54,256 KB |
testcase_06 | AC | 188 ms
54,860 KB |
testcase_07 | AC | 189 ms
56,416 KB |
testcase_08 | AC | 201 ms
56,628 KB |
testcase_09 | AC | 175 ms
54,956 KB |
testcase_10 | AC | 175 ms
56,824 KB |
testcase_11 | AC | 113 ms
54,060 KB |
testcase_12 | AC | 189 ms
56,636 KB |
testcase_13 | AC | 205 ms
56,232 KB |
testcase_14 | AC | 153 ms
55,420 KB |
testcase_15 | AC | 162 ms
54,288 KB |
testcase_16 | AC | 159 ms
56,604 KB |
testcase_17 | AC | 175 ms
56,644 KB |
testcase_18 | AC | 160 ms
54,932 KB |
testcase_19 | AC | 153 ms
54,308 KB |
testcase_20 | AC | 178 ms
56,612 KB |
testcase_21 | AC | 163 ms
54,860 KB |
testcase_22 | AC | 87 ms
52,640 KB |
testcase_23 | AC | 87 ms
52,712 KB |
testcase_24 | AC | 85 ms
53,092 KB |
testcase_25 | AC | 85 ms
52,828 KB |
testcase_26 | AC | 87 ms
53,004 KB |
ソースコード
public class Main { private static void solve() { int n = ni(); for (int i = (n + 2) / 2; i <= n; i++) { out.print(i + " "); } out.println(); } 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)); } }