結果
問題 | No.219 巨大数の概算 |
ユーザー | uwi |
提出日時 | 2015-05-29 22:33:58 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 234 ms / 1,500 ms |
コード長 | 3,104 bytes |
コンパイル時間 | 5,237 ms |
コンパイル使用メモリ | 79,528 KB |
実行使用メモリ | 60,636 KB |
最終ジャッジ日時 | 2023-09-25 13:25:39 |
合計ジャッジ時間 | 18,704 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 230 ms
60,032 KB |
testcase_01 | AC | 229 ms
60,144 KB |
testcase_02 | AC | 229 ms
59,220 KB |
testcase_03 | AC | 221 ms
60,284 KB |
testcase_04 | AC | 230 ms
60,036 KB |
testcase_05 | AC | 85 ms
53,500 KB |
testcase_06 | AC | 115 ms
53,528 KB |
testcase_07 | AC | 85 ms
53,560 KB |
testcase_08 | AC | 117 ms
53,612 KB |
testcase_09 | AC | 88 ms
53,732 KB |
testcase_10 | AC | 230 ms
60,284 KB |
testcase_11 | AC | 231 ms
59,796 KB |
testcase_12 | AC | 231 ms
60,276 KB |
testcase_13 | AC | 232 ms
59,908 KB |
testcase_14 | AC | 230 ms
60,236 KB |
testcase_15 | AC | 225 ms
60,476 KB |
testcase_16 | AC | 229 ms
59,844 KB |
testcase_17 | AC | 231 ms
59,796 KB |
testcase_18 | AC | 230 ms
59,760 KB |
testcase_19 | AC | 234 ms
60,188 KB |
testcase_20 | AC | 229 ms
60,236 KB |
testcase_21 | AC | 231 ms
60,284 KB |
testcase_22 | AC | 228 ms
60,124 KB |
testcase_23 | AC | 229 ms
59,956 KB |
testcase_24 | AC | 230 ms
60,192 KB |
testcase_25 | AC | 233 ms
58,788 KB |
testcase_26 | AC | 229 ms
58,244 KB |
testcase_27 | AC | 223 ms
58,696 KB |
testcase_28 | AC | 230 ms
59,868 KB |
testcase_29 | AC | 228 ms
59,920 KB |
testcase_30 | AC | 232 ms
60,328 KB |
testcase_31 | AC | 227 ms
60,236 KB |
testcase_32 | AC | 230 ms
60,248 KB |
testcase_33 | AC | 229 ms
60,052 KB |
testcase_34 | AC | 229 ms
59,876 KB |
testcase_35 | AC | 230 ms
59,784 KB |
testcase_36 | AC | 233 ms
60,084 KB |
testcase_37 | AC | 234 ms
60,140 KB |
testcase_38 | AC | 229 ms
60,636 KB |
testcase_39 | AC | 231 ms
60,264 KB |
testcase_40 | AC | 230 ms
60,328 KB |
testcase_41 | AC | 228 ms
60,212 KB |
testcase_42 | AC | 228 ms
60,396 KB |
testcase_43 | AC | 230 ms
60,100 KB |
testcase_44 | AC | 225 ms
60,192 KB |
testcase_45 | AC | 231 ms
60,120 KB |
testcase_46 | AC | 231 ms
60,304 KB |
testcase_47 | AC | 227 ms
60,076 KB |
testcase_48 | AC | 231 ms
60,324 KB |
testcase_49 | AC | 229 ms
60,236 KB |
testcase_50 | AC | 227 ms
60,160 KB |
testcase_51 | AC | 83 ms
53,604 KB |
ソースコード
package contest; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Q593 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); for(int i = 0;i < n;i++){ long a = ni(), b = ni(); double ba = b*Math.log10(a) + 1E-12; long z = (long)Math.floor(ba); int argmin = -1; for(int j = 10;j <= 99;j++){ if(ba >= (z-1 + Math.log10(j))){ argmin = j; } } out.println(argmin/10 + " " + (argmin%10) + " " + z); } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Q593().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }