結果

問題 No.389 ロジックパズルの組み合わせ
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2016-07-08 22:29:01
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 357 ms / 2,000 ms
コード長 7,915 bytes
コンパイル時間 4,045 ms
コンパイル使用メモリ 112,720 KB
実行使用メモリ 78,408 KB
最終ジャッジ日時 2023-08-03 06:52:59
合計ジャッジ時間 30,466 ms
ジャッジサーバーID
(参考情報)
judge14 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 219 ms
46,336 KB
testcase_01 AC 60 ms
21,900 KB
testcase_02 AC 214 ms
52,460 KB
testcase_03 AC 213 ms
46,440 KB
testcase_04 AC 215 ms
52,600 KB
testcase_05 AC 58 ms
15,800 KB
testcase_06 AC 58 ms
15,596 KB
testcase_07 AC 59 ms
15,540 KB
testcase_08 AC 60 ms
15,684 KB
testcase_09 AC 234 ms
49,600 KB
testcase_10 AC 232 ms
56,372 KB
testcase_11 AC 242 ms
50,748 KB
testcase_12 AC 229 ms
56,328 KB
testcase_13 AC 273 ms
59,656 KB
testcase_14 AC 239 ms
57,752 KB
testcase_15 AC 228 ms
48,228 KB
testcase_16 AC 229 ms
58,288 KB
testcase_17 AC 236 ms
50,576 KB
testcase_18 AC 321 ms
75,784 KB
testcase_19 AC 215 ms
52,376 KB
testcase_20 AC 215 ms
46,352 KB
testcase_21 AC 214 ms
52,568 KB
testcase_22 AC 216 ms
46,544 KB
testcase_23 AC 213 ms
54,480 KB
testcase_24 AC 214 ms
46,416 KB
testcase_25 AC 221 ms
52,620 KB
testcase_26 AC 215 ms
46,404 KB
testcase_27 AC 222 ms
54,716 KB
testcase_28 AC 214 ms
46,352 KB
testcase_29 AC 214 ms
52,432 KB
testcase_30 AC 214 ms
46,292 KB
testcase_31 AC 215 ms
50,584 KB
testcase_32 AC 214 ms
46,416 KB
testcase_33 AC 214 ms
52,540 KB
testcase_34 AC 215 ms
46,412 KB
testcase_35 AC 214 ms
52,556 KB
testcase_36 AC 213 ms
46,404 KB
testcase_37 AC 214 ms
50,556 KB
testcase_38 AC 215 ms
46,348 KB
testcase_39 AC 216 ms
52,540 KB
testcase_40 AC 214 ms
46,416 KB
testcase_41 AC 217 ms
52,428 KB
testcase_42 AC 217 ms
46,340 KB
testcase_43 AC 216 ms
52,484 KB
testcase_44 AC 212 ms
46,404 KB
testcase_45 AC 216 ms
52,472 KB
testcase_46 AC 218 ms
46,356 KB
testcase_47 AC 216 ms
50,436 KB
testcase_48 AC 215 ms
46,476 KB
testcase_49 AC 323 ms
74,840 KB
testcase_50 AC 226 ms
53,180 KB
testcase_51 AC 224 ms
47,560 KB
testcase_52 AC 238 ms
58,204 KB
testcase_53 AC 230 ms
48,832 KB
testcase_54 AC 245 ms
60,876 KB
testcase_55 AC 220 ms
46,876 KB
testcase_56 AC 230 ms
56,012 KB
testcase_57 AC 266 ms
57,644 KB
testcase_58 AC 306 ms
73,644 KB
testcase_59 AC 284 ms
69,676 KB
testcase_60 AC 250 ms
53,884 KB
testcase_61 AC 357 ms
78,408 KB
testcase_62 AC 248 ms
64,084 KB
testcase_63 AC 304 ms
66,320 KB
testcase_64 AC 240 ms
60,624 KB
testcase_65 AC 235 ms
50,224 KB
testcase_66 AC 245 ms
59,508 KB
testcase_67 AC 244 ms
53,012 KB
testcase_68 AC 245 ms
63,572 KB
testcase_69 AC 215 ms
46,384 KB
testcase_70 AC 216 ms
52,600 KB
testcase_71 AC 215 ms
46,464 KB
testcase_72 AC 218 ms
52,416 KB
testcase_73 AC 214 ms
46,384 KB
testcase_74 AC 215 ms
52,536 KB
testcase_75 AC 215 ms
46,228 KB
testcase_76 AC 214 ms
52,408 KB
testcase_77 AC 214 ms
46,548 KB
testcase_78 AC 213 ms
52,396 KB
testcase_79 AC 213 ms
46,460 KB
testcase_80 AC 217 ms
52,420 KB
testcase_81 AC 215 ms
46,348 KB
testcase_82 AC 214 ms
52,468 KB
testcase_83 AC 215 ms
46,444 KB
testcase_84 AC 215 ms
50,352 KB
testcase_85 AC 214 ms
46,404 KB
testcase_86 AC 214 ms
52,408 KB
testcase_87 AC 215 ms
46,536 KB
testcase_88 AC 217 ms
52,392 KB
testcase_89 AC 255 ms
54,964 KB
testcase_90 AC 277 ms
70,560 KB
testcase_91 AC 315 ms
74,116 KB
testcase_92 AC 237 ms
55,264 KB
testcase_93 AC 281 ms
61,292 KB
testcase_94 AC 221 ms
52,768 KB
testcase_95 AC 285 ms
61,880 KB
testcase_96 AC 274 ms
65,664 KB
testcase_97 AC 267 ms
58,588 KB
testcase_98 AC 244 ms
61,384 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.Linq.Expressions;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
//using System.Numerics;
using Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var a = sc.ScanLine().Split().Select(int.Parse).ToArray();
            if (a[0] == 0)
            {
                IO.Printer.Out.WriteLine(1);
                return;

            }
            var sum = a.Sum() + a.Count() - 1;
            var table = new ModTable(2000000);
            var p = a.Count() + 1;
            var rem = n - sum;
            if (rem < 0)
                IO.Printer.Out.WriteLine("NA");
            else
            {
                IO.Printer.Out.WriteLine(table.RepeatedCombination(p, rem));
            }

        }
        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; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }


    }
}
#region main
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 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, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public 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) && !isEof); 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 string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') 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 != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            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() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
        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); }
    }
}
#endregion
#region ModNumber
public partial struct ModInteger
{
    public const long Mod = (long)1e9 + 7;
    public long num;
    public ModInteger(long n) : this() { num = n % Mod; if (num < 0) num += Mod; }
    public override string ToString() { return num.ToString(); }
    public static ModInteger operator +(ModInteger l, ModInteger r) { var n = l.num + r.num; if (n >= Mod) n -= Mod; return new ModInteger() { num = n }; }
    public static ModInteger operator -(ModInteger l, ModInteger r) { var n = l.num + Mod - r.num; if (n >= Mod) n -= Mod; return new ModInteger() { num = n }; }
    public static ModInteger operator *(ModInteger l, ModInteger r) { return new ModInteger(l.num * r.num); }
    public static ModInteger operator ^(ModInteger l, long r) { return ModInteger.Pow(l, r); }
    public static implicit operator ModInteger(long n) { return new ModInteger(n); }
    public static ModInteger Pow(ModInteger v, long k)
    {
        ModInteger ret = 1;
        var n = k;
        for (; n > 0; n >>= 1, v *= v)
        {
            if ((n & 1) == 1)
                ret = ret * v;
        }
        return ret;
    }
}
#endregion
#region Inverse
public partial struct ModInteger
{
    static public ModInteger Inverse(ModInteger v)
    {
        long p, q;
        ExGCD(v.num, Mod, out p, out q);
        return new ModInteger(p % Mod + Mod);
    }
    static public long ExGCD(long a, long b, out long x, out long y)
    {
        var u = new long[] { a, 1, 0 };
        var v = new long[] { b, 0, 1 };
        while (v[0] != 0)
        {
            var t = u[0] / v[0];
            for (int i = 0; i < 3; i++)
            {
                var tmp = u[i] - t * v[i];
                u[i] = v[i];
                v[i] = tmp;
            }
        }
        x = u[1];
        y = u[2];
        if (u[0] > 0)
            return u[0];
        for (int i = 0; i < 3; i++)
            u[i] = -u[i];
        return u[0];

    }
}
#endregion
#region ModTable
public class ModTable
{
    public ModInteger[] perm, inv;
    public ModTable(int n)
    {
        perm = new ModInteger[n + 1];
        inv = new ModInteger[n + 1];
        perm[0] = 1;
        for (int i = 1; i <= n; i++)
            perm[i] = perm[i - 1] * i;
        inv[n] = ModInteger.Inverse(perm[n]);
        for (int i = n - 1; i >= 0; i--)
            inv[i] = inv[i + 1] * (i + 1);
        inv[0] = inv[1];
    }
    public ModInteger Inverse(int k) { return inv[k]; }
    public ModInteger Permutation(int n, int k)
    {
        if (n < 0 || n >= perm.Length)
            return 0;
        if (k < 0 || k >= n)
            return 0;
        return perm[n] * inv[n - k];
    }
    public ModInteger Combination(int n, int r)
    {
        if (n < 0 || n >= perm.Length || r < 0 || r > n) return 0;
        return perm[n] * inv[n - r] * inv[r];
    }
    public ModInteger RepeatedCombination(int n, int k)
    {
        if (k == 0) return 1;
        return Combination(n + k - 1, k);
    }
}
#endregion
0