結果

問題 No.3054 ほぼ直角二等辺三角形
ユーザー claw88claw88
提出日時 2019-04-01 23:08:36
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 4,446 bytes
コンパイル時間 860 ms
コンパイル使用メモリ 117,088 KB
実行使用メモリ 26,884 KB
最終ジャッジ日時 2024-05-05 08:51:32
合計ジャッジ時間 2,611 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 27 ms
24,708 KB
testcase_02 AC 28 ms
24,672 KB
testcase_03 AC 28 ms
24,452 KB
testcase_04 AC 29 ms
26,608 KB
testcase_05 AC 29 ms
24,620 KB
testcase_06 AC 30 ms
26,744 KB
testcase_07 AC 29 ms
24,580 KB
testcase_08 AC 31 ms
24,832 KB
testcase_09 AC 30 ms
24,580 KB
testcase_10 AC 29 ms
24,580 KB
testcase_11 AC 31 ms
26,616 KB
testcase_12 AC 31 ms
24,832 KB
testcase_13 AC 30 ms
24,628 KB
testcase_14 AC 31 ms
24,712 KB
testcase_15 AC 30 ms
26,496 KB
testcase_16 AC 31 ms
24,708 KB
testcase_17 AC 30 ms
26,884 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.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        var A = new[] {1,5,29,169,985,5741,33461,195025,1136689,6625109,
 38613965,225058681,1311738121,7645370045,
 44560482149,259717522849,1513744654945,
 8822750406821,51422757785981,299713796309065,
 1746860020068409,10181446324101389,
 59341817924539925, 345869461223138161};




        int X = cin.nextint;
        

        for (int i = 0; i < A.Length; i++)
        {
            if (A[i].ToString().Length == X)
            {
                var J = (BigInteger)A[i] * A[i] * 2 - 1;
                var d = sqrt(J);
                var a = (d - 1) / 2;
                WriteLine($"{a} {a + 1} {A[i]}");
                return;
            }
        }
        //for (int i = 2; i <= A.Length; i++)
        //{
        //    WriteLine((BigInteger)6 * A[i - 1] -  A[i - 2]);
        //}
    }
    BigInteger sqrt(BigInteger X)
    {
        BigInteger ok = 0;
        BigInteger ng = X;
        while (ng - ok > 1)
        {
            var mid = (ok + ng) / 2;
            var d = mid * mid;
            if (d == X)
            {
                return mid;
            }
            if (d < X)
            {
                ok = mid;
            }
            else
            {
                ng = mid;
            }
        }
        return ok;
    }
}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}
0