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

提出ソース

結果

問題	No.219 巨大数の概算
ユーザー	ぴろず
提出日時	2015-06-02 14:23:51
言語	Java21 (openjdk 21)
結果	TLE
実行時間	-
コード長	5,174 bytes
コンパイル時間	2,239 ms
コンパイル使用メモリ	77,624 KB
実行使用メモリ	68,812 KB
最終ジャッジ日時	2023-09-20 18:47:12
合計ジャッジ時間	79,024 ms
ジャッジサーバーID （参考情報）	judge12 / judge14

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,483 ms 58,252 KB
testcase_01	TLE	-
testcase_02	TLE	-
testcase_03	TLE	-
testcase_04	TLE	-
testcase_05	AC	136 ms 54,372 KB
testcase_06	AC	387 ms 57,296 KB
testcase_07	AC	93 ms 53,924 KB
testcase_08	AC	399 ms 58,132 KB
testcase_09	AC	89 ms 53,820 KB
testcase_10	TLE	-
testcase_11	TLE	-
testcase_12	TLE	-
testcase_13	TLE	-
testcase_14	AC	1,472 ms 58,748 KB
testcase_15	AC	1,477 ms 58,604 KB
testcase_16	AC	1,494 ms 58,224 KB
testcase_17	AC	1,496 ms 58,456 KB
testcase_18	TLE	-
testcase_19	TLE	-
testcase_20	TLE	-
testcase_21	AC	1,484 ms 58,452 KB
testcase_22	AC	1,489 ms 59,712 KB
testcase_23	TLE	-
testcase_24	TLE	-
testcase_25	TLE	-
testcase_26	TLE	-
testcase_27	TLE	-
testcase_28	TLE	-
testcase_29	AC	1,488 ms 58,912 KB
testcase_30	TLE	-
testcase_31	TLE	-
testcase_32	TLE	-
testcase_33	AC	1,499 ms 58,196 KB
testcase_34	TLE	-
testcase_35	TLE	-
testcase_36	TLE	-
testcase_37	TLE	-
testcase_38	TLE	-
testcase_39	AC	1,483 ms 58,712 KB
testcase_40	AC	1,490 ms 58,376 KB
testcase_41	TLE	-
testcase_42	TLE	-
testcase_43	TLE	-
testcase_44	TLE	-
testcase_45	TLE	-
testcase_46	TLE	-
testcase_47	TLE	-
testcase_48	TLE	-
testcase_49	AC	1,481 ms 58,660 KB
testcase_50	AC	1,490 ms 58,488 KB
testcase_51	AC	92 ms 52,568 KB

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

ソースコード

raw source code

package no219;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
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++) {
			io.println(new Decimal(io.nextInt()).pow(io.nextInt()));
		}
		io.flush();
	}

	public static int N = 20;
	public static BigInteger TENPOWN = BigInteger.TEN.pow(N);
	public static class Decimal {
		BigInteger base;
		long exp;
		public Decimal(int num) {
			this(TENPOWN.multiply(BigInteger.valueOf(num)),-N);
			normalize();
		}
		public Decimal(BigInteger base,long exp) {
			this.base = base;
			this.exp = exp;
			normalize();
//			System.out.println(this.base + "," + this.exp + "," + this);
		}
		private void normalize() {
			while(base.compareTo(TENPOWN) > 0) {
				base = base.divide(BigInteger.TEN);
				exp++;
			}
		}
		public Decimal mult(Decimal b) {
			return new Decimal(base.multiply(b.base), exp + b.exp);
		}
		public Decimal pow(long n) {
			Decimal ret = new Decimal(1);
			Decimal x = this;
			while(n > 0) {
				if ((n & 1) == 1) {
					ret = ret.mult(x);
				}
				x = x.mult(x);
				n >>>= 1;
			}
			return ret;
		}
		public String toString() {
			int xy = base.divide(TENPOWN.divide(BigInteger.valueOf(100))).intValue();
			return (xy / 10) + " " + (xy % 10) + " " + (exp + N - 1);
		}
	}
}

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

結果

テストケース

ソースコード