結果

問題 No.456 Millions of Submits!
ユーザー GrenacheGrenache
提出日時 2017-01-18 01:06:36
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,493 bytes
コンパイル時間 4,054 ms
コンパイル使用メモリ 80,124 KB
実行使用メモリ 96,276 KB
最終ジャッジ日時 2024-06-23 18:20:11
合計ジャッジ時間 12,095 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder456_2 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int m = sc.nextInt();

		StringBuilder ret = new StringBuilder();

		for (int i = 0; i < m; i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			double t = sc.nextDouble();

			if (a == 0) {
//				pr.printf("%.10f\n", Math.pow(Math.E, Math.pow(t, (double)1 / b)));
				ret.append(String.format("%.10f\n", Math.pow(Math.E, Math.pow(t, (double)1 / b))));
			} else if (b == 0) {
//				pr.printf("%.10f\n", Math.pow(t, (double)1 / a));
				ret.append(String.format("%.10f\n", Math.pow(t, (double)1 / a)));
			} else {
				double x = 1;
//				double x = 3;
				double g = a * x + b * Math.log(x);
//				double g = Math.pow(x, a) * Math.pow(Math.log(x), b);
				t = Math.log(t);
				double EPS = 1.e-12;

				while (Math.abs(g - t) > EPS) {
					x -= (g - t) / (a + b / x);
//					x -= (g - t) / (Math.pow(x, a - 1) * Math.pow(Math.log(x), b - 1) * (a * Math.log(x) + b));
					g = a * x + b * Math.log(x);
//					g = Math.pow(x, a) * Math.pow(Math.log(x), b);

//					pr.printf("%.10f\n", g);
				}

//				pr.printf("%.10f\n", Math.pow(Math.E, x));
				ret.append(String.format("%.10f\n", Math.pow(Math.E, x)));
//				pr.printf("%.10f\n", x);
			}
		}

		pr.println(ret);
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
//			return Double.parseDouble(next());
			double ret = 0;
			try {
				boolean flag = false;
				double base = 0.1;
				int ch = nextPrintable();
				do {
					if (ch == '.') {
						flag = true;
					} else {
						if (!flag) {
							ret *= 10;
							ret += ch - '0';
						} else {
							ret += (ch - '0') * base;
							base /= 10;
						}
					}
				} while (isPrintable(ch = br.read()));

				return ret;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0