結果

問題 No.250 atetubouのzetubou
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-07-25 01:44:17
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 144 ms / 5,000 ms
コード長 4,985 bytes
コンパイル時間 1,107 ms
コンパイル使用メモリ 121,028 KB
実行使用メモリ 99,560 KB
最終ジャッジ日時 2024-07-16 04:23:06
合計ジャッジ時間 4,842 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 135 ms
97,256 KB
testcase_01 AC 135 ms
95,068 KB
testcase_02 AC 144 ms
97,268 KB
testcase_03 AC 143 ms
99,420 KB
testcase_04 AC 136 ms
99,176 KB
testcase_05 AC 139 ms
95,332 KB
testcase_06 AC 139 ms
97,400 KB
testcase_07 AC 137 ms
99,176 KB
testcase_08 AC 140 ms
97,380 KB
testcase_09 AC 137 ms
99,560 KB
testcase_10 AC 138 ms
97,504 KB
testcase_11 AC 143 ms
97,124 KB
testcase_12 AC 142 ms
97,248 KB
testcase_13 AC 137 ms
97,372 KB
testcase_14 AC 132 ms
97,400 KB
testcase_15 AC 143 ms
99,164 KB
testcase_16 AC 139 ms
99,304 KB
testcase_17 AC 139 ms
97,368 KB
testcase_18 AC 142 ms
99,296 KB
testcase_19 AC 141 ms
95,332 KB
testcase_20 AC 133 ms
99,416 KB
testcase_21 AC 131 ms
99,292 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.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var q = sc.Integer();
            var table = new CombinationTable(4000);
            for (int i = 0; i < q; i++)
            {
                var d = sc.Integer() - 1;
                var x = sc.Integer() + 1;
                var T = sc.Double();
                var sum = table[x + d - 1, d];
                Debug.WriteLine(sum);
                IO.Printer.Out.WriteLine(sum <= T ? "AC" : "ZETUBOU");
            }

        }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }

    }

}

#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, IEnumerable<T> source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        private readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while (b < 33 || 126 < b);            return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion

#region CombinationTable
public class CombinationTable
{
    double[][] nCr;
    public CombinationTable(int n)
    {
        nCr = new double[n + 1][];
        for (int i = 0; i <= n; i++)
            nCr[i] = new double[i + 2];
        nCr[0][0] = 1;
        for (int i = 1; i <= n; i++)
            for (int j = 0; j <= i; j++)
                if (j > 0)
                    nCr[i][j] = nCr[i - 1][j - 1] + nCr[i - 1][j];
                else nCr[i][j] = 1;
    }
    public double this[int n, int r]
    {
        get
        {
            if (n <= 0 || n > nCr.Length)
                return 1;
            if (r <= 0 || r > n)
                return 1;
            return nCr[n][r];
        }
    }
}
#endregion
0