結果
問題 | No.219 巨大数の概算 |
ユーザー | ぴろず |
提出日時 | 2015-05-29 22:41:04 |
言語 | Java21 (openjdk 21) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 4,166 bytes |
コンパイル時間 | 2,537 ms |
コンパイル使用メモリ | 80,032 KB |
実行使用メモリ | 54,976 KB |
最終ジャッジ日時 | 2024-10-07 16:57:25 |
合計ジャッジ時間 | 16,835 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 209 ms
42,432 KB |
testcase_01 | AC | 205 ms
41,524 KB |
testcase_02 | AC | 207 ms
42,652 KB |
testcase_03 | AC | 209 ms
42,984 KB |
testcase_04 | WA | - |
testcase_05 | AC | 96 ms
40,092 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 101 ms
40,296 KB |
testcase_10 | AC | 221 ms
41,604 KB |
testcase_11 | AC | 217 ms
42,536 KB |
testcase_12 | AC | 219 ms
43,908 KB |
testcase_13 | AC | 202 ms
42,940 KB |
testcase_14 | AC | 205 ms
41,916 KB |
testcase_15 | AC | 210 ms
42,440 KB |
testcase_16 | AC | 218 ms
43,492 KB |
testcase_17 | AC | 224 ms
42,768 KB |
testcase_18 | AC | 217 ms
41,760 KB |
testcase_19 | AC | 219 ms
43,292 KB |
testcase_20 | AC | 204 ms
42,728 KB |
testcase_21 | AC | 215 ms
44,216 KB |
testcase_22 | AC | 213 ms
43,196 KB |
testcase_23 | AC | 219 ms
41,936 KB |
testcase_24 | AC | 205 ms
41,996 KB |
testcase_25 | AC | 202 ms
42,644 KB |
testcase_26 | AC | 212 ms
41,768 KB |
testcase_27 | AC | 223 ms
42,420 KB |
testcase_28 | WA | - |
testcase_29 | AC | 208 ms
42,676 KB |
testcase_30 | AC | 213 ms
43,156 KB |
testcase_31 | AC | 226 ms
45,204 KB |
testcase_32 | AC | 209 ms
42,272 KB |
testcase_33 | AC | 221 ms
42,736 KB |
testcase_34 | AC | 218 ms
41,724 KB |
testcase_35 | AC | 222 ms
43,840 KB |
testcase_36 | AC | 214 ms
43,208 KB |
testcase_37 | AC | 224 ms
42,676 KB |
testcase_38 | AC | 220 ms
41,800 KB |
testcase_39 | AC | 222 ms
41,776 KB |
testcase_40 | AC | 227 ms
41,844 KB |
testcase_41 | AC | 220 ms
41,996 KB |
testcase_42 | AC | 223 ms
42,568 KB |
testcase_43 | AC | 214 ms
42,476 KB |
testcase_44 | AC | 211 ms
44,144 KB |
testcase_45 | AC | 207 ms
42,568 KB |
testcase_46 | AC | 205 ms
43,648 KB |
testcase_47 | AC | 223 ms
43,488 KB |
testcase_48 | AC | 226 ms
41,748 KB |
testcase_49 | AC | 226 ms
42,356 KB |
testcase_50 | AC | 219 ms
42,388 KB |
testcase_51 | AC | 97 ms
40,408 KB |
ソースコード
package no219; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.InputMismatchException; import java.util.NoSuchElementException; public class Main { static IO io = new IO(); public static void main(String[] args) { int n = io.nextInt(); for(int i=0;i<n;i++) { long a = io.nextLong(); long b = io.nextLong(); double log = b * Math.log10(a); long z = (long) Math.floor(log); double xy = log - z; int x = 0, y = 0; for(int j=1;j<=100;j++) { if (Math.log10(j) - 1 >= xy) { j--; x = j / 10; y = j % 10; break; } } io.println(x + " " + y + " " + z); } io.flush(); } } class IO extends PrintWriter { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public IO() { this(System.in);} public IO(InputStream source) { super(System.out); this.in = source;} private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private static boolean isNewLine(int c) { return c == '\n' || c == '\r';} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();} public String next() { if (!hasNext()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public char[] nextCharArray(int len) { if (!hasNext()) { throw new NoSuchElementException(); } char[] s = new char[len]; int i = 0; int b = readByte(); while(isPrintableChar(b)) { if (i == len) { throw new InputMismatchException(); } s[i++] = (char) b; b = readByte(); } return s; } public String nextLine() { if (!hasNextLine()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(!isNewLine(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) { throw new NoSuchElementException(); } long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) { throw new NumberFormatException(); } return (int) nl; } public char nextChar() { if (!hasNext()) { throw new NoSuchElementException(); } return (char) readByte(); } public double nextDouble() { return Double.parseDouble(next());} public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;} public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;} public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;} public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();} public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;} public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;} public void close() { super.close(); try {in.close();} catch (IOException e) {}} }