結果

問題 No.456 Millions of Submits!
ユーザー くれちー
提出日時 2018-01-14 00:18:10
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 4,065 ms / 4,500 ms
コード長 9,846 bytes
コンパイル時間 1,264 ms
コンパイル使用メモリ 120,984 KB
実行使用メモリ 31,320 KB
最終ジャッジ日時 2024-12-31 01:17:32
合計ジャッジ時間 15,073 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 13
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Text;
using static System.Math;
using static Extensions;
using static MathExtensions;
public static class Program
{
public static void Solve()
{
void Write(double d) => Console.WriteLine($"{d:f9}");
var m = I;
Repeat(m, () =>
{
var (a, b, t) = ((double)I, (double)I, D);
if (a == 0.0) { Write(Exp(Pow(t, 1.0 / b))); return; }
if (b == 0.0) { Write(Pow(t, 1.0 / a)); return; }
var n = 2.0;
double d;
do
{
var t1 = Log(n);
var t2 = Pow(n, a - 2.0);
var t3 = Pow(t1, b - 2.0);
var d0 = t2 * n * n * t3 * t1 * t1 - t;
var d1 = t2 * n * t3 * t1 * (a * t1 + b);
var d2 = t2 * t3 * (((a * 2.0 - 1.0) * b + (a - 1.0) * a * t1) * t1 + (b - 1.0) * b);
d = d0 / (d1 - (d0 * d2) / (d1 * 2.0));
n -= d;
}
while (Abs(d) > 10e-10);
Write(n);
});
}
#region Scanners
static TextScanner _ts;
static char C => char.Parse(_ts.Next());
static string S => _ts.Next();
static int I => int.Parse(_ts.Next());
static long L => long.Parse(_ts.Next());
static BigInteger B => BigInteger.Parse(_ts.Next());
static double D => double.Parse(_ts.Next());
static decimal M => decimal.Parse(_ts.Next());
#endregion
public static void Main()
{
var sw = new StreamWriter(Console.OpenStandardOutput());
sw.NewLine = "\n";
#if DEBUG
sw.AutoFlush = true;
#else
sw.AutoFlush = false;
#endif
Console.SetOut(sw);
_ts = new TextScanner(Console.In);
Solve();
Console.Out.Flush();
}
}
public static partial class Extensions
{
}
#region Library
#pragma warning disable
public class TextScanner
{
private readonly TextReader _tr;
public TextScanner(TextReader tr)
{
_tr = tr;
}
public string Next()
{
var sb = new StringBuilder();
int i;
do
{
i = _tr.Read();
if (i == -1) throw new EndOfStreamException();
}
while (char.IsWhiteSpace((char)i));
while (i != -1 && !char.IsWhiteSpace((char)i))
{
sb.Append((char)i);
i = _tr.Read();
}
return sb.ToString();
}
}
[DebuggerStepThrough]
public static partial class Extensions
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static void Assert(bool condition)
{
if (!condition) throw new Exception("Assertion failed");
}
public static string AsString(this IEnumerable<char> source) => new string(source.ToArray());
public static Dictionary<T, int> Bucket<T>(this IEnumerable<T> source) where T : IEquatable<T>
{
var dict = new Dictionary<T, int>();
foreach (var item in source) if (dict.ContainsKey(item)) dict[item]++; else dict[item] = 1;
return dict;
}
public static int[] Bucket<T>(this IEnumerable<T> source, int maxValue, Func<T, int> selector)
{
var arr = new int[maxValue + 1];
foreach (var item in source) arr[selector(item)]++;
return arr;
}
public static IEnumerable<int> CumSum(this IEnumerable<int> source)
{
var sum = 0;
foreach (var item in source) yield return sum += item;
}
public static IEnumerable<long> CumSum(this IEnumerable<long> source)
{
var sum = 0L;
foreach (var item in source) yield return sum += item;
}
public static void Exit(int exitCode)
{
Console.Out.Flush();
Environment.Exit(exitCode);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static void ForEach<T>(this IEnumerable<T> source, Action<T> action)
{
foreach (var item in source) action(item);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, _> func)
{
foreach (var item in source) func(item);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static void ForEach<T>(this IEnumerable<T> source, Action<T, int> action)
{
var i = 0;
foreach (var item in source) action(item, i++);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, int, _> func)
{
var i = 0;
foreach (var item in source) func(item, i++);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static void Repeat(int count, Action action)
{
for (var i = 0; i < count; i++) action();
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static void Repeat(int count, Action<int> action)
{
for (var i = 0; i < count; i++) action(i);
}
public static IEnumerable<T> Repeat<T>(int count, Func<T> func)
{
for (var i = 0; i < count; i++) yield return func();
}
public static IEnumerable<T> Repeat<T>(int count, Func<int, T> func)
{
for (var i = 0; i < count; i++) yield return func(i);
}
public static void Swap<T>(ref T x, ref T y)
{
var tmp = x; x = y; y = tmp;
}
public static (T1[], T2[]) Unzip<T1, T2>(this ICollection<(T1, T2)> source)
{
var ts1 = new T1[source.Count];
var ts2 = new T2[source.Count];
var i = 0;
foreach (var (t1, t2) in source) { ts1[i] = t1; ts2[i] = t2; i++; }
return (ts1, ts2);
}
public static (T1[], T2[], T3[]) Unzip<T1, T2, T3>(this ICollection<(T1, T2, T3)> source)
{
var ts1 = new T1[source.Count];
var ts2 = new T2[source.Count];
var ts3 = new T3[source.Count];
var i = 0;
foreach (var (t1, t2, t3) in source) { ts1[i] = t1; ts2[i] = t2; ts3[i] = t3; i++; }
return (ts1, ts2, ts3);
}
public static (T1[], T2[], T3[], T4[]) Unzip<T1, T2, T3, T4>(this ICollection<(T1, T2, T3, T4)> source)
{
var ts1 = new T1[source.Count];
var ts2 = new T2[source.Count];
var ts3 = new T3[source.Count];
var ts4 = new T4[source.Count];
var i = 0;
foreach (var (t1, t2, t3, t4) in source) { ts1[i] = t1; ts2[i] = t2; ts3[i] = t3; ts4[i] = t4; i++; }
return (ts1, ts2, ts3, ts4);
}
public static IEnumerable<T> Zip<T1, T2, T3, T>(this IEnumerable<T1> first, IEnumerable<T2> second, IEnumerable<T3> thrid, Func<T1, T2, T3, T>
        resultSelector)
{
using (var e1 = first.GetEnumerator())
using (var e2 = second.GetEnumerator())
using (var e3 = thrid.GetEnumerator())
{
while (e1.MoveNext() && e2.MoveNext() && e3.MoveNext())
yield return resultSelector(e1.Current, e2.Current, e3.Current);
}
}
public static IEnumerable<T> Zip<T1, T2, T3, T4, T>(this IEnumerable<T1> first, IEnumerable<T2> second, IEnumerable<T3> thrid, IEnumerable<T4>
        fourth, Func<T1, T2, T3, T4, T> resultSelector)
{
using (var e1 = first.GetEnumerator())
using (var e2 = second.GetEnumerator())
using (var e3 = thrid.GetEnumerator())
using (var e4 = fourth.GetEnumerator())
{
while (e1.MoveNext() && e2.MoveNext() && e3.MoveNext() && e4.MoveNext())
yield return resultSelector(e1.Current, e2.Current, e3.Current, e4.Current);
}
}
}
[DebuggerStepThrough]
public static class MathExtensions
{
public static int DivCeil(int left, int right)
=> left / right + (left % right == 0 ? 0 : 1);
public static long DivCeil(long left, long right)
=> left / right + (left % right == 0L ? 0L : 1L);
public static int Gcd(int left, int right)
{
int r;
while ((r = left % right) != 0) { left = right; right = r; }
return right;
}
public static long Gcd(long left, long right)
{
long r;
while ((r = left % right) != 0L) { left = right; right = r; }
return right;
}
public static BigInteger Gcd(BigInteger left, BigInteger right)
=> BigInteger.GreatestCommonDivisor(left, right);
public static int HighestOneBit(int x)
{
x |= x >> 01;
x |= x >> 02;
x |= x >> 04;
x |= x >> 08;
x |= x >> 16;
return x - (x >> 1);
}
public static long HighestOneBit(long x)
{
x |= x >> 01;
x |= x >> 02;
x |= x >> 04;
x |= x >> 08;
x |= x >> 16;
x |= x >> 32;
return x - (x >> 1);
}
public static int Lcm(int left, int right) => left / Gcd(left, right) * right;
public static long Lcm(long left, long right) => left / Gcd(left, right) * right;
public static BigInteger Lcm(BigInteger left, BigInteger right)
=> left / Gcd(left, right) * right;
public static int Pow(int value, int exponent)
{
var r = 1;
while (exponent > 0)
{
if ((exponent & 1) == 1) r *= value;
value *= value;
exponent >>= 1;
}
return r;
}
public static long Pow(long value, int exponent)
{
var r = 1L;
while (exponent > 0)
{
if ((exponent & 1) == 1) r *= value;
value *= value;
exponent >>= 1;
}
return r;
}
public static long Fact(int value)
{
var r = 1L;
for (var i = 2; i <= value; i++) r *= i;
return r;
}
}
#pragma warning restore
#endregion
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0