結果
問題 | No.219 巨大数の概算 |
ユーザー | tenten |
提出日時 | 2022-10-14 09:11:18 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,396 bytes |
コンパイル時間 | 2,385 ms |
コンパイル使用メモリ | 79,592 KB |
実行使用メモリ | 59,744 KB |
最終ジャッジ日時 | 2024-06-26 12:28:08 |
合計ジャッジ時間 | 22,211 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 247 ms
56,936 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 101 ms
52,832 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 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
ソースコード
import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); StringBuilder sb = new StringBuilder(); for (int i = 0; i < n; i++) { sb.append(pow(new Num(sc.nextLong()), sc.nextLong())).append("\n"); } System.out.print(sb); } static Num pow(Num x, long p) { if (p == 0) { return new Num(1); } else if (p % 2 == 0) { return pow(x.pow2(), p / 2); } else { return pow(x, p - 1).multiply(x); } } static class Num { long value; long size; public Num(long x, long size) { value = x; this.size = size; normalize(); } public Num(long x) { this(x, 0); } public void normalize() { while (value > Integer.MAX_VALUE) { value /= 10; size++; } } public Num multiply(Num another) { return new Num(value * another.value, size + another.size); } public Num pow2() { return new Num(value * value, size * 2); } public String toString() { while (value < 10) { value *= 10; size--; } while (value >= 100) { value /= 10; size++; } return value / 10 + " " + (value % 10) + " " + (size + 1); } } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }