結果

問題 No.219 巨大数の概算
ユーザー uwiuwi
提出日時 2015-05-30 01:49:00
言語 Java21
(openjdk 21)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,599 bytes
コンパイル時間 5,695 ms
コンパイル使用メモリ 78,008 KB
実行使用メモリ 81,344 KB
最終ジャッジ日時 2023-09-25 14:03:57
合計ジャッジ時間 82,461 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 TLE -
testcase_01 TLE -
testcase_02 TLE -
testcase_03 TLE -
testcase_04 AC 1,230 ms
71,124 KB
testcase_05 AC 113 ms
52,984 KB
testcase_06 AC 373 ms
61,560 KB
testcase_07 AC 91 ms
53,240 KB
testcase_08 AC 400 ms
67,008 KB
testcase_09 AC 88 ms
52,964 KB
testcase_10 TLE -
testcase_11 AC 1,187 ms
70,464 KB
testcase_12 AC 1,252 ms
70,972 KB
testcase_13 TLE -
testcase_14 AC 1,402 ms
70,284 KB
testcase_15 AC 1,379 ms
71,076 KB
testcase_16 AC 1,435 ms
71,460 KB
testcase_17 TLE -
testcase_18 TLE -
testcase_19 TLE -
testcase_20 AC 1,401 ms
71,896 KB
testcase_21 AC 1,408 ms
70,348 KB
testcase_22 AC 1,384 ms
73,320 KB
testcase_23 AC 1,480 ms
70,964 KB
testcase_24 TLE -
testcase_25 TLE -
testcase_26 TLE -
testcase_27 TLE -
testcase_28 AC 1,229 ms
68,984 KB
testcase_29 TLE -
testcase_30 TLE -
testcase_31 TLE -
testcase_32 TLE -
testcase_33 AC 1,396 ms
71,628 KB
testcase_34 AC 1,253 ms
69,156 KB
testcase_35 AC 1,493 ms
78,232 KB
testcase_36 TLE -
testcase_37 TLE -
testcase_38 TLE -
testcase_39 AC 1,401 ms
73,156 KB
testcase_40 AC 1,417 ms
72,704 KB
testcase_41 TLE -
testcase_42 AC 1,414 ms
70,720 KB
testcase_43 AC 1,369 ms
72,060 KB
testcase_44 AC 1,350 ms
72,016 KB
testcase_45 TLE -
testcase_46 TLE -
testcase_47 AC 1,229 ms
69,000 KB
testcase_48 AC 1,383 ms
71,772 KB
testcase_49 TLE -
testcase_50 TLE -
testcase_51 AC 90 ms
52,740 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.MathContext;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q593_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		MathContext mc = MathContext.DECIMAL128;
		for(int i = 0;i < n;i++){
			long a = ni(), b = ni();
			BigDecimal A = BigDecimal.valueOf(a);
			int s = Long.toString(a).length();
			A = A.scaleByPowerOfTen(-s);
			BigDecimal D = BigDecimal.ONE;
			for(int d = 30;d >= 0;d--){
				D = D.pow(2, mc);
				if(b<<~d<0){
					D = D.multiply(A, mc);
				}
			}
//			tr(D.toEngineeringString());
//			tr(D.unscaledValue());
//			tr(D.scale());
			long ss = (long)s*b;
			ss -= D.scale();
			D = D.scaleByPowerOfTen(D.scale());
			while(D.compareTo(BigDecimal.TEN) >= 0){
				D = D.scaleByPowerOfTen(-1);
				ss++;
			}
//			tr(D);
			out.println(D.unscaledValue().toString().charAt(0) + " " + D.unscaledValue().toString().charAt(1) + " " + ss);
		}
	}
	
	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_2().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