結果

問題 No.648 　お　や　す　み　
ユーザー くれちーくれちー
提出日時 2018-02-09 22:43:34
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 65 ms / 2,000 ms
コード長 8,413 bytes
コンパイル時間 3,417 ms
コンパイル使用メモリ 116,004 KB
実行使用メモリ 23,036 KB
最終ジャッジ日時 2023-10-11 22:06:01
合計ジャッジ時間 10,707 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
22,884 KB
testcase_01 AC 61 ms
22,836 KB
testcase_02 AC 64 ms
18,736 KB
testcase_03 AC 61 ms
22,860 KB
testcase_04 AC 61 ms
20,808 KB
testcase_05 AC 65 ms
22,912 KB
testcase_06 AC 61 ms
22,720 KB
testcase_07 AC 61 ms
20,732 KB
testcase_08 AC 61 ms
20,900 KB
testcase_09 AC 63 ms
20,784 KB
testcase_10 AC 61 ms
20,680 KB
testcase_11 AC 61 ms
20,788 KB
testcase_12 AC 61 ms
20,744 KB
testcase_13 AC 61 ms
22,828 KB
testcase_14 AC 60 ms
18,684 KB
testcase_15 AC 61 ms
22,832 KB
testcase_16 AC 62 ms
20,808 KB
testcase_17 AC 61 ms
20,788 KB
testcase_18 AC 61 ms
18,736 KB
testcase_19 AC 62 ms
20,972 KB
testcase_20 AC 63 ms
20,964 KB
testcase_21 AC 64 ms
22,824 KB
testcase_22 AC 64 ms
21,028 KB
testcase_23 AC 64 ms
22,856 KB
testcase_24 AC 64 ms
20,780 KB
testcase_25 AC 65 ms
22,820 KB
testcase_26 AC 63 ms
20,864 KB
testcase_27 AC 65 ms
18,816 KB
testcase_28 AC 64 ms
22,780 KB
testcase_29 AC 65 ms
23,036 KB
testcase_30 AC 61 ms
22,804 KB
testcase_31 AC 61 ms
20,804 KB
testcase_32 AC 61 ms
18,700 KB
testcase_33 AC 61 ms
20,848 KB
testcase_34 AC 61 ms
22,948 KB
testcase_35 AC 61 ms
20,720 KB
testcase_36 AC 62 ms
22,836 KB
testcase_37 AC 62 ms
20,804 KB
testcase_38 AC 62 ms
20,852 KB
testcase_39 AC 62 ms
22,856 KB
testcase_40 AC 61 ms
20,852 KB
testcase_41 AC 61 ms
18,812 KB
testcase_42 AC 60 ms
20,784 KB
testcase_43 AC 60 ms
20,744 KB
testcase_44 AC 60 ms
20,896 KB
testcase_45 AC 60 ms
20,916 KB
testcase_46 AC 60 ms
20,844 KB
testcase_47 AC 61 ms
20,808 KB
testcase_48 AC 60 ms
20,732 KB
testcase_49 AC 61 ms
20,872 KB
testcase_50 AC 64 ms
22,904 KB
testcase_51 AC 64 ms
20,804 KB
testcase_52 AC 64 ms
20,852 KB
testcase_53 AC 64 ms
20,964 KB
testcase_54 AC 63 ms
20,860 KB
testcase_55 AC 65 ms
22,868 KB
testcase_56 AC 64 ms
22,824 KB
testcase_57 AC 65 ms
22,820 KB
testcase_58 AC 64 ms
20,912 KB
testcase_59 AC 64 ms
18,740 KB
testcase_60 AC 60 ms
22,864 KB
testcase_61 AC 61 ms
18,724 KB
testcase_62 AC 62 ms
20,700 KB
testcase_63 AC 61 ms
20,748 KB
testcase_64 AC 61 ms
22,784 KB
testcase_65 AC 61 ms
20,744 KB
testcase_66 AC 62 ms
20,808 KB
testcase_67 AC 61 ms
20,816 KB
testcase_68 AC 61 ms
20,812 KB
testcase_69 AC 61 ms
20,676 KB
testcase_70 AC 62 ms
20,996 KB
testcase_71 AC 62 ms
22,968 KB
testcase_72 AC 62 ms
20,688 KB
testcase_73 AC 62 ms
22,772 KB
testcase_74 AC 60 ms
22,860 KB
testcase_75 AC 62 ms
22,788 KB
testcase_76 AC 61 ms
18,900 KB
testcase_77 AC 64 ms
20,916 KB
testcase_78 AC 65 ms
22,900 KB
testcase_79 AC 64 ms
20,912 KB
testcase_80 AC 63 ms
20,880 KB
testcase_81 AC 65 ms
20,876 KB
testcase_82 AC 63 ms
22,896 KB
testcase_83 AC 64 ms
22,836 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Text;
using static System.Convert;
using static System.Math;
using static Constants;
using static Extensions;
using static MathExtensions;

public static class Program
{
    public static void Solve()
    {
        var n = L;
        var ok = new BigInteger(1e18 * 2);
        var ng = new BigInteger(0);

        while (BigInteger.Abs(ok - ng) > 1)
        {
            var mid = (ok + ng) / 2;
            if (mid * (mid + 1) / 2 >= n) ok = mid;
            else ng = mid;
        }

        if (ok * (ok + 1) / 2 != n) Answer(NO);

        Console.WriteLine(YES);
        Console.WriteLine(ok);
    }

    #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
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();
    }
}

public static class Constants
{
    public const int AnswerToLifeTheUniverseAndEverything = 42;
    public const string Yes = nameof(Yes);
    public const string No = nameof(No);
    public const string YES = nameof(YES);
    public const string NO = nameof(NO);
    public const string Possible = nameof(Possible);
    public const string Impossible = nameof(Impossible);
}

[DebuggerStepThrough]
public static partial class Extensions
{
    public static void Answer(string str)
    {
        Console.WriteLine(str);
        Exit(0);
    }

    public static void Answer(object obj) => Answer(obj.ToString());

    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);
    }

    public static void ForEach<T>(this IEnumerable<T> source, Action<T> action)
    {
        foreach (var item in source) action(item);
    }

    public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, _> func)
    {
        foreach (var item in source) func(item);
    }

    public static void ForEach<T>(this IEnumerable<T> source, Action<T, int> action)
    {
        var i = 0;
        foreach (var item in source) action(item, i++);
    }

    public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, int, _> func)
    {
        var i = 0;
        foreach (var item in source) func(item, i++);
    }

    public static void Repeat(int count, Action action)
    {
        for (var i = 0; i < count; i++) action();
    }

    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);
    }
}

[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;
    }
}
#endregion
0