結果
問題 | No.722 100×100=1000 |
ユーザー | hiromi_ayase |
提出日時 | 2018-08-06 02:53:38 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 81 ms / 2,000 ms |
コード長 | 2,841 bytes |
コンパイル時間 | 2,369 ms |
コンパイル使用メモリ | 82,228 KB |
実行使用メモリ | 38,416 KB |
最終ジャッジ日時 | 2024-06-09 11:00:27 |
合計ジャッジ時間 | 5,721 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 78 ms
37,984 KB |
testcase_01 | AC | 78 ms
38,268 KB |
testcase_02 | AC | 76 ms
38,352 KB |
testcase_03 | AC | 77 ms
38,164 KB |
testcase_04 | AC | 73 ms
37,844 KB |
testcase_05 | AC | 75 ms
38,268 KB |
testcase_06 | AC | 78 ms
38,300 KB |
testcase_07 | AC | 79 ms
38,288 KB |
testcase_08 | AC | 72 ms
37,960 KB |
testcase_09 | AC | 72 ms
38,284 KB |
testcase_10 | AC | 79 ms
38,416 KB |
testcase_11 | AC | 75 ms
37,960 KB |
testcase_12 | AC | 76 ms
38,100 KB |
testcase_13 | AC | 77 ms
37,960 KB |
testcase_14 | AC | 79 ms
38,120 KB |
testcase_15 | AC | 79 ms
37,984 KB |
testcase_16 | AC | 77 ms
37,984 KB |
testcase_17 | AC | 77 ms
38,116 KB |
testcase_18 | AC | 75 ms
37,804 KB |
testcase_19 | AC | 77 ms
37,844 KB |
testcase_20 | AC | 76 ms
37,976 KB |
testcase_21 | AC | 78 ms
38,268 KB |
testcase_22 | AC | 77 ms
37,976 KB |
testcase_23 | AC | 75 ms
38,204 KB |
testcase_24 | AC | 77 ms
38,220 KB |
testcase_25 | AC | 81 ms
38,288 KB |
testcase_26 | AC | 76 ms
38,244 KB |
testcase_27 | AC | 79 ms
37,976 KB |
testcase_28 | AC | 78 ms
37,960 KB |
testcase_29 | AC | 77 ms
37,960 KB |
testcase_30 | AC | 78 ms
38,156 KB |
ソースコード
public class Main { private static void solve() { long a = nl(); long b = nl(); if (check(a) && check(b)) { System.out.println(a * b / 10); } else { long x = a * b; if (Math.abs(x) > 99999999) { System.out.println("E"); } else { System.out.println(x); } } } private static boolean check(long a) { while (Math.abs(a) >= 1000) { if (a % 10 != 0) return false; a /= 10; } return a % 100 == 0; } 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)); } }