#52408 (Java21) No.219 巨大数の概算

提出ソース

結果

問題	No.219 巨大数の概算
ユーザー	ぴろず
提出日時	2015-10-08 11:16:43
言語	Java21 (openjdk 21)
結果	AC
実行時間	254 ms / 1,500 ms
コード長	4,286 bytes
コンパイル時間	4,155 ms
コンパイル使用メモリ	76,948 KB
実行使用メモリ	59,792 KB
最終ジャッジ日時	2023-09-25 14:54:15
合計ジャッジ時間	18,841 ms
ジャッジサーバーID （参考情報）	judge11 / judge14

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	246 ms 59,792 KB
testcase_01	AC	247 ms 59,032 KB
testcase_02	AC	243 ms 54,620 KB
testcase_03	AC	250 ms 59,336 KB
testcase_04	AC	246 ms 59,200 KB
testcase_05	AC	83 ms 53,528 KB
testcase_06	AC	127 ms 52,980 KB
testcase_07	AC	92 ms 53,580 KB
testcase_08	AC	131 ms 54,368 KB
testcase_09	AC	84 ms 53,676 KB
testcase_10	AC	241 ms 59,396 KB
testcase_11	AC	254 ms 59,136 KB
testcase_12	AC	251 ms 59,160 KB
testcase_13	AC	231 ms 56,952 KB
testcase_14	AC	242 ms 59,700 KB
testcase_15	AC	249 ms 59,448 KB
testcase_16	AC	252 ms 59,544 KB
testcase_17	AC	252 ms 59,384 KB
testcase_18	AC	243 ms 57,556 KB
testcase_19	AC	245 ms 58,604 KB
testcase_20	AC	248 ms 59,608 KB
testcase_21	AC	250 ms 59,420 KB
testcase_22	AC	250 ms 59,460 KB
testcase_23	AC	250 ms 59,224 KB
testcase_24	AC	249 ms 59,420 KB
testcase_25	AC	244 ms 59,040 KB
testcase_26	AC	250 ms 59,736 KB
testcase_27	AC	241 ms 58,200 KB
testcase_28	AC	243 ms 59,696 KB
testcase_29	AC	242 ms 56,992 KB
testcase_30	AC	244 ms 59,132 KB
testcase_31	AC	249 ms 59,688 KB
testcase_32	AC	248 ms 59,308 KB
testcase_33	AC	248 ms 59,588 KB
testcase_34	AC	245 ms 59,508 KB
testcase_35	AC	234 ms 56,940 KB
testcase_36	AC	243 ms 59,132 KB
testcase_37	AC	235 ms 57,772 KB
testcase_38	AC	243 ms 59,432 KB
testcase_39	AC	248 ms 58,872 KB
testcase_40	AC	246 ms 59,448 KB
testcase_41	AC	249 ms 59,380 KB
testcase_42	AC	246 ms 58,960 KB
testcase_43	AC	250 ms 59,280 KB
testcase_44	AC	249 ms 59,192 KB
testcase_45	AC	252 ms 59,440 KB
testcase_46	AC	244 ms 57,028 KB
testcase_47	AC	246 ms 59,148 KB
testcase_48	AC	236 ms 56,668 KB
testcase_49	AC	246 ms 59,468 KB
testcase_50	AC	247 ms 59,336 KB
testcase_51	AC	87 ms 53,600 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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;
			double errorMin = Double.POSITIVE_INFINITY;
			int x = 0, y = 0;
			for(int j=10;j<=99;j++) {
				double logj = Math.log10(j / 10D);
				double error = Math.abs(logj - xy);
				if (error < errorMin) {
					x = j / 10;
					y = j % 10;
					errorMin = error;
				}
			}
			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) {}}
}

yukicoder

結果

テストケース

ソースコード