結果

問題 No.219 巨大数の概算
ユーザー ぴろずぴろず
提出日時 2015-10-08 11:09:06
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,167 bytes
コンパイル時間 2,466 ms
コンパイル使用メモリ 79,956 KB
実行使用メモリ 51,508 KB
最終ジャッジ日時 2024-07-20 02:10:53
合計ジャッジ時間 16,733 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 212 ms
42,696 KB
testcase_01 AC 214 ms
42,608 KB
testcase_02 AC 213 ms
42,612 KB
testcase_03 AC 209 ms
41,832 KB
testcase_04 WA -
testcase_05 AC 93 ms
39,716 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 94 ms
40,056 KB
testcase_10 AC 217 ms
40,928 KB
testcase_11 AC 214 ms
42,420 KB
testcase_12 AC 215 ms
43,404 KB
testcase_13 AC 214 ms
43,356 KB
testcase_14 AC 209 ms
43,576 KB
testcase_15 AC 208 ms
43,232 KB
testcase_16 AC 217 ms
42,924 KB
testcase_17 AC 215 ms
42,496 KB
testcase_18 AC 219 ms
42,996 KB
testcase_19 AC 211 ms
42,420 KB
testcase_20 AC 217 ms
43,288 KB
testcase_21 AC 210 ms
42,788 KB
testcase_22 AC 217 ms
43,188 KB
testcase_23 AC 219 ms
42,864 KB
testcase_24 AC 210 ms
42,132 KB
testcase_25 AC 213 ms
43,552 KB
testcase_26 AC 219 ms
42,692 KB
testcase_27 AC 214 ms
41,748 KB
testcase_28 WA -
testcase_29 AC 225 ms
43,604 KB
testcase_30 AC 205 ms
43,532 KB
testcase_31 AC 221 ms
43,216 KB
testcase_32 AC 211 ms
43,260 KB
testcase_33 AC 215 ms
41,980 KB
testcase_34 AC 212 ms
44,736 KB
testcase_35 AC 211 ms
42,332 KB
testcase_36 AC 214 ms
43,172 KB
testcase_37 AC 218 ms
42,864 KB
testcase_38 AC 206 ms
42,512 KB
testcase_39 AC 224 ms
42,544 KB
testcase_40 AC 217 ms
43,520 KB
testcase_41 AC 220 ms
42,504 KB
testcase_42 AC 209 ms
43,348 KB
testcase_43 AC 216 ms
42,764 KB
testcase_44 AC 209 ms
42,352 KB
testcase_45 AC 223 ms
42,140 KB
testcase_46 AC 216 ms
42,576 KB
testcase_47 AC 213 ms
41,884 KB
testcase_48 AC 214 ms
42,928 KB
testcase_49 AC 211 ms
42,692 KB
testcase_50 AC 219 ms
43,076 KB
testcase_51 AC 93 ms
40,088 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no219b;

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 / 10D)>= 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) {}}
}
0