#30466 (Java) No.219 巨大数の概算

• 問題: No.219 巨大数の概算
• ユーザー: ぴろず
• 提出日時: 2015-06-02 14:21:46
• 言語: Java (openjdk 23)
• 結果: TLE
• 実行時間: -
• コード長: 5,169 bytes
• コンパイル時間: 2,230 ms
• コンパイル使用メモリ: 80,460 KB
• 実行使用メモリ: 132,952 KB
• 最終ジャッジ日時: 2024-07-06 13:38:27
• 合計ジャッジ時間: 8,191 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
sample	-- * 1
other	TLE * 1 -- * 50

ソースコード

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++) {
			System.out.println(new Decimal(io.nextInt()).pow(io.nextInt()));
		}
	}

	public static int N = 100;
	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) {
		}
	}
}