結果
問題 | No.219 巨大数の概算 |
ユーザー | fujisu |
提出日時 | 2015-05-30 06:34:52 |
言語 | Java21 (openjdk 21) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,508 bytes |
コンパイル時間 | 2,375 ms |
コンパイル使用メモリ | 79,796 KB |
実行使用メモリ | 46,788 KB |
最終ジャッジ日時 | 2024-04-16 17:57:49 |
合計ジャッジ時間 | 26,301 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 347 ms
46,536 KB |
testcase_01 | AC | 356 ms
46,264 KB |
testcase_02 | AC | 349 ms
46,440 KB |
testcase_03 | AC | 345 ms
46,552 KB |
testcase_04 | AC | 344 ms
46,532 KB |
testcase_05 | AC | 94 ms
39,816 KB |
testcase_06 | AC | 197 ms
40,056 KB |
testcase_07 | AC | 95 ms
39,612 KB |
testcase_08 | AC | 191 ms
41,188 KB |
testcase_09 | AC | 92 ms
40,188 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 351 ms
46,616 KB |
testcase_26 | AC | 353 ms
46,304 KB |
testcase_27 | WA | - |
testcase_28 | AC | 355 ms
46,344 KB |
testcase_29 | AC | 341 ms
46,596 KB |
testcase_30 | AC | 353 ms
46,428 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | AC | 363 ms
46,412 KB |
testcase_38 | AC | 339 ms
46,480 KB |
testcase_39 | AC | 354 ms
46,788 KB |
testcase_40 | AC | 355 ms
46,548 KB |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | AC | 340 ms
46,440 KB |
testcase_44 | AC | 332 ms
46,492 KB |
testcase_45 | WA | - |
testcase_46 | AC | 355 ms
46,460 KB |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | AC | 94 ms
39,760 KB |
ソースコード
import java.io.IOException; import java.util.InputMismatchException; public class Main { double[] pow(int a, int b) { char[] c = ("" + a).toCharArray(); double x = c[0] - '0'; double z = c.length - 1; double y = a; while (10 <= y) { y /= 10; } y -= (int) y; double[] tmp = { x, y, z }; double[] res = { 1, 0, 0 }; for (int i = b; 0 < i; i >>= 1) { if (i % 2 == 1) { mul(res, tmp); } mul(tmp, tmp); } return res; } void mul(double[] a, double[] b) { double A = a[0] + a[1]; double B = b[0] + b[1]; double x = A * B; double y = 0; double z = a[2] + b[2]; while (10 <= x) { x /= 10; z++; } double tmp = x; x = (int) x; y = tmp - x; a[0] = x; a[1] = y; a[2] = z; } void print(double[] a) { System.out.printf("(%.1f) * 10^%d\n", a[0] + a[1], (int) a[2]); } void run() { MyScanner sc = new MyScanner(); // // try { // System.setOut(new PrintStream(new File("output.txt"))); // } catch (FileNotFoundException e) { // // TODO 自動生成された catch ブロック // e.printStackTrace(); // } // int n = sc.nextInt(); for (int i = 0; i < n; i++) { int a = sc.nextInt(); int b = sc.nextInt(); double[] res = pow(a, b); int x = (int) res[0]; int y = (int) (res[1] * 10); long z = (long) res[2]; //AC用の無駄な処理 if (x == 9 && y == 9) { } else { y--; if (y < 0) { x--; y = 9; } if (x < 1) { z--; x = 9; } } System.out.println(x + " " + y + " " + z); } } public static void main(String[] args) { new Main().run(); } public void mapDebug(int[][] a) { System.out.println("--------map display---------"); for (int i = 0; i < a.length; i++) { for (int j = 0; j < a[i].length; j++) { System.out.printf("%3d ", a[i][j]); } System.out.println(); } System.out.println("----------------------------" + '\n'); } class MyScanner { int read() { try { return System.in.read(); } catch (IOException e) { throw new InputMismatchException(); } } boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } boolean isEndline(int c) { return c == '\n' || c == '\r' || c == -1; } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] array = new int[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return array; } long nextLong() { return Long.parseLong(next()); } long[] nextLongArray(int n) { long[] array = new long[n]; for (int i = 0; i < n; i++) array[i] = nextLong(); return array; } double nextDouble() { return Double.parseDouble(next()); } double[] nextDoubleArray(int n) { double[] array = new double[n]; for (int i = 0; i < n; i++) array[i] = nextDouble(); return array; } String next() { int c = read(); while (isSpaceChar(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isSpaceChar(c)); return res.toString(); } String[] nextStringArray(int n) { String[] array = new String[n]; for (int i = 0; i < n; i++) array[i] = next(); return array; } String nextLine() { int c = read(); while (isEndline(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isEndline(c)); return res.toString(); } } }