結果

問題 No.219 巨大数の概算
ユーザー uwiuwi
提出日時 2015-05-29 22:37:31
言語 Java21
(openjdk 21)
結果
AC  
実行時間 216 ms / 1,500 ms
コード長 3,104 bytes
コンパイル時間 3,824 ms
コンパイル使用メモリ 83,388 KB
実行使用メモリ 47,408 KB
最終ジャッジ日時 2024-07-18 10:37:12
合計ジャッジ時間 16,761 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 200 ms
45,244 KB
testcase_01 AC 196 ms
45,776 KB
testcase_02 AC 204 ms
45,640 KB
testcase_03 AC 216 ms
44,740 KB
testcase_04 AC 211 ms
46,056 KB
testcase_05 AC 77 ms
39,992 KB
testcase_06 AC 112 ms
40,372 KB
testcase_07 AC 87 ms
40,180 KB
testcase_08 AC 112 ms
40,040 KB
testcase_09 AC 87 ms
39,868 KB
testcase_10 AC 209 ms
46,012 KB
testcase_11 AC 203 ms
45,824 KB
testcase_12 AC 208 ms
45,708 KB
testcase_13 AC 203 ms
45,996 KB
testcase_14 AC 198 ms
45,760 KB
testcase_15 AC 196 ms
47,408 KB
testcase_16 AC 209 ms
45,676 KB
testcase_17 AC 204 ms
45,076 KB
testcase_18 AC 208 ms
45,904 KB
testcase_19 AC 193 ms
44,680 KB
testcase_20 AC 208 ms
44,996 KB
testcase_21 AC 203 ms
44,728 KB
testcase_22 AC 210 ms
45,804 KB
testcase_23 AC 207 ms
45,576 KB
testcase_24 AC 200 ms
45,096 KB
testcase_25 AC 199 ms
46,044 KB
testcase_26 AC 190 ms
45,896 KB
testcase_27 AC 198 ms
46,032 KB
testcase_28 AC 204 ms
45,520 KB
testcase_29 AC 202 ms
45,660 KB
testcase_30 AC 198 ms
43,864 KB
testcase_31 AC 206 ms
45,752 KB
testcase_32 AC 205 ms
46,152 KB
testcase_33 AC 214 ms
46,020 KB
testcase_34 AC 203 ms
45,824 KB
testcase_35 AC 195 ms
45,840 KB
testcase_36 AC 199 ms
45,356 KB
testcase_37 AC 196 ms
45,240 KB
testcase_38 AC 199 ms
45,888 KB
testcase_39 AC 207 ms
46,156 KB
testcase_40 AC 199 ms
45,760 KB
testcase_41 AC 208 ms
45,876 KB
testcase_42 AC 206 ms
45,920 KB
testcase_43 AC 197 ms
45,936 KB
testcase_44 AC 208 ms
44,156 KB
testcase_45 AC 200 ms
45,948 KB
testcase_46 AC 197 ms
45,652 KB
testcase_47 AC 202 ms
45,596 KB
testcase_48 AC 202 ms
45,812 KB
testcase_49 AC 204 ms
45,076 KB
testcase_50 AC 199 ms
45,588 KB
testcase_51 AC 90 ms
40,196 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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-10;
			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)); }
}
0