結果

問題 No.456 Millions of Submits!
ユーザー くれちー
提出日時 2017-09-01 22:32:33
言語 C#(csc)
(csc 3.9.0)
結果
TLE  
実行時間 -
コード長 2,943 bytes
コンパイル時間 4,581 ms
コンパイル使用メモリ 118,680 KB
実行使用メモリ 213,700 KB
最終ジャッジ日時 2024-06-23 19:15:10
合計ジャッジ時間 9,536 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 12 TLE * 1
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

using System;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Extentions;
class IO
{
int idx;
string[] input = In.ReadToEnd().Split(new[] { " ", "\n", "\r" },
StringSplitOptions.RemoveEmptyEntries);
T Get<T>(Func<string, T> parser) => parser(input[idx++]);
public string S => Get(s => s);
public char C => Get(char.Parse);
public int I => Get(int.Parse);
public long L => Get(long.Parse);
public double F => Get(double.Parse);
public decimal D => Get(decimal.Parse);
public BigInteger B => Get(BigInteger.Parse);
T[] Gets<T>(int n, Func<string, T> parser)
=> input.Skip((idx += n) - n).Take(n).Select(parser).ToArray();
public string[] Ss(int n) => Gets(n, s => s);
public char[] Cs(int n) => Gets(n, char.Parse);
public int[] Is(int n) => Gets(n, int.Parse);
public long[] Ls(int n) => Gets(n, long.Parse);
public double[] Fs(int n) => Gets(n, double.Parse);
public decimal[] Ds(int n) => Gets(n, decimal.Parse);
public BigInteger[] Bs(int n) => Gets(n, BigInteger.Parse);
public void Write<T>(params T[] xs) => WriteLine(string.Join(" ", xs));
public void Write(params object[] xs) => WriteLine(string.Join(" ", xs));
}
#region Library
static class Halley
{
public static double Iterate(
Func<double, double> f,
Func<double, double> df1, Func<double, double> df2,
double init, double tolerance)
{
double d;
var x = init;
do
{
var fx = f(x);
var df1x = df1(x);
var df2x = df2(x);
x -= d = (2 * fx * df1x) / (2 * Pow(df1x, 2) - fx * df2x);
}
while (Abs(d) >= tolerance);
return x;
}
}
static class Extentions
{
}
#endregion
static class Program
{
public static void Main()
{
var sw = new StreamWriter(OpenStandardOutput()) { NewLine = "\n" };
#if DEBUG
sw.AutoFlush = true;
#else
sw.AutoFlush = false;
#endif
SetOut(sw);
Solve(new IO());
Out.Flush();
}
static void Solve(IO io)
{
var m = io.I;
for (var i = 0; i < m; i++)
{
var a = io.I;
var b = io.I;
var t = io.F;
var n = a == 0 ? Exp(Pow(t, 1.0 / b)) : b == 0 ? Pow(t, 1.0 / a) :
Halley.Iterate(
x => Pow(x, a) * Pow(Log(x), b) - t,
x => Pow(x, a - 1.0) * Pow(Log(x), b - 1.0) * (a * Log(x) + b),
x => Pow(x, a - 2.0) * Pow(Log(x), b - 2.0) * ((2.0 * a - 1.0) * b * Log(x) + (a - 1.0) * a * Pow(Log(x), 2.0) + (b - 1.0) * b),
2.0, 1e-9
);
WriteLine("{0:f9}", n);
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0