結果

問題 No.389 ロジックパズルの組み合わせ
ユーザー りあんりあん
提出日時 2016-07-08 22:27:43
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 187 ms / 2,000 ms
コード長 5,508 bytes
コンパイル時間 1,045 ms
コンパイル使用メモリ 110,080 KB
実行使用メモリ 46,336 KB
最終ジャッジ日時 2024-04-21 05:53:22
合計ジャッジ時間 9,225 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 33 ms
18,944 KB
testcase_01 AC 31 ms
19,072 KB
testcase_02 AC 32 ms
19,072 KB
testcase_03 AC 31 ms
18,944 KB
testcase_04 AC 31 ms
19,072 KB
testcase_05 AC 30 ms
19,072 KB
testcase_06 AC 29 ms
18,944 KB
testcase_07 AC 29 ms
19,072 KB
testcase_08 AC 31 ms
18,944 KB
testcase_09 AC 46 ms
21,168 KB
testcase_10 AC 46 ms
21,632 KB
testcase_11 AC 54 ms
21,676 KB
testcase_12 AC 42 ms
20,736 KB
testcase_13 AC 77 ms
27,776 KB
testcase_14 AC 50 ms
22,360 KB
testcase_15 AC 41 ms
20,736 KB
testcase_16 AC 43 ms
21,248 KB
testcase_17 AC 51 ms
21,668 KB
testcase_18 AC 122 ms
36,480 KB
testcase_19 AC 30 ms
18,944 KB
testcase_20 AC 30 ms
19,072 KB
testcase_21 AC 30 ms
19,328 KB
testcase_22 AC 31 ms
18,944 KB
testcase_23 AC 31 ms
19,200 KB
testcase_24 AC 31 ms
18,816 KB
testcase_25 AC 34 ms
19,456 KB
testcase_26 AC 29 ms
19,072 KB
testcase_27 AC 33 ms
19,328 KB
testcase_28 AC 31 ms
19,200 KB
testcase_29 AC 31 ms
18,944 KB
testcase_30 AC 34 ms
19,200 KB
testcase_31 AC 32 ms
19,072 KB
testcase_32 AC 32 ms
18,944 KB
testcase_33 AC 31 ms
19,200 KB
testcase_34 AC 31 ms
19,072 KB
testcase_35 AC 33 ms
19,200 KB
testcase_36 AC 31 ms
18,944 KB
testcase_37 AC 32 ms
19,328 KB
testcase_38 AC 31 ms
19,200 KB
testcase_39 AC 31 ms
19,328 KB
testcase_40 AC 32 ms
19,200 KB
testcase_41 AC 32 ms
19,328 KB
testcase_42 AC 32 ms
18,944 KB
testcase_43 AC 32 ms
19,200 KB
testcase_44 AC 32 ms
19,200 KB
testcase_45 AC 32 ms
18,944 KB
testcase_46 AC 32 ms
19,072 KB
testcase_47 AC 30 ms
19,072 KB
testcase_48 AC 32 ms
19,072 KB
testcase_49 AC 126 ms
36,992 KB
testcase_50 AC 41 ms
20,864 KB
testcase_51 AC 43 ms
20,608 KB
testcase_52 AC 51 ms
22,656 KB
testcase_53 AC 44 ms
20,864 KB
testcase_54 AC 56 ms
23,552 KB
testcase_55 AC 38 ms
19,840 KB
testcase_56 AC 44 ms
20,864 KB
testcase_57 AC 73 ms
26,368 KB
testcase_58 AC 115 ms
35,584 KB
testcase_59 AC 96 ms
33,024 KB
testcase_60 AC 59 ms
23,424 KB
testcase_61 AC 187 ms
46,336 KB
testcase_62 AC 67 ms
23,688 KB
testcase_63 AC 122 ms
36,096 KB
testcase_64 AC 63 ms
23,296 KB
testcase_65 AC 54 ms
21,656 KB
testcase_66 AC 65 ms
23,296 KB
testcase_67 AC 61 ms
23,128 KB
testcase_68 AC 63 ms
23,608 KB
testcase_69 AC 37 ms
19,328 KB
testcase_70 AC 36 ms
19,072 KB
testcase_71 AC 35 ms
19,328 KB
testcase_72 AC 30 ms
19,200 KB
testcase_73 AC 31 ms
19,072 KB
testcase_74 AC 31 ms
19,200 KB
testcase_75 AC 31 ms
19,072 KB
testcase_76 AC 30 ms
19,072 KB
testcase_77 AC 29 ms
19,200 KB
testcase_78 AC 29 ms
19,200 KB
testcase_79 AC 30 ms
19,328 KB
testcase_80 AC 29 ms
19,072 KB
testcase_81 AC 30 ms
19,328 KB
testcase_82 AC 31 ms
19,200 KB
testcase_83 AC 31 ms
19,072 KB
testcase_84 AC 31 ms
18,944 KB
testcase_85 AC 32 ms
19,328 KB
testcase_86 AC 30 ms
19,072 KB
testcase_87 AC 32 ms
19,200 KB
testcase_88 AC 31 ms
19,072 KB
testcase_89 AC 68 ms
24,576 KB
testcase_90 AC 87 ms
32,640 KB
testcase_91 AC 123 ms
36,736 KB
testcase_92 AC 48 ms
21,860 KB
testcase_93 AC 95 ms
32,768 KB
testcase_94 AC 37 ms
19,968 KB
testcase_95 AC 100 ms
33,152 KB
testcase_96 AC 80 ms
27,392 KB
testcase_97 AC 73 ms
26,752 KB
testcase_98 AC 54 ms
23,296 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 System.Text;

class Program
{
    const int M = 1000000007;
    const double eps = 1e-9;
    static int[] dd = { 0, 1, 0, -1, 0 };
    static void Main()
    {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var sc = new Scan();
        int m = sc.Int;
        var h = sc.IntArr;
        if (h[0] == 0)
        {
            Console.WriteLine(1);
            return;
        }
        int k = h.Length;
        int sum = h.Sum() + k - 1;
        int n = m - sum;
        if (n < 0)
        {
            Console.WriteLine("NA");
            return;
        }
        var mt = new mymath();
        long ans = mt.Comb(n + k, k);
        sw.WriteLine(ans % M);
        sw.Flush();
    }
    
    static void swap<T>(ref T a, ref T b) { var t = a; a = b; b = t; }

    static T[] copy<T>(T[] a)
    {
        var ret = new T[a.Length];
        for (int i = 0; i < a.Length; i++) ret[i] = a[i];
        return ret;
    }
    static T[][] copy2<T>(T[][] a)
    {
        var ret = new T[a.Length][];
        for (int i = 0; i < a.Length; i++)
        {
            ret[i] = new T[a[0].Length];
            for (int j = 0; j < a[0].Length; j++) ret[i][j] = a[i][j];
        }
        return ret;
    }
}
class Scan
{
    public int Int { get { return int.Parse(Str); } }
    public long Long { get { return long.Parse(Str); } }
    public string Str { get { return Console.ReadLine().Trim(); } }
    public int[] IntArr { get { return StrArr.Select(int.Parse).ToArray(); } }
    public int[] IntArrWithSep(char sep) { return Str.Split(sep).Select(int.Parse).ToArray(); }
    public long[] LongArr { get { return StrArr.Select(long.Parse).ToArray(); } }
    public double[] DoubleArr { get { return StrArr.Select(double.Parse).ToArray(); } }
    public string[] StrArr { get { return Str.Split(); } }
    public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; }
    public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; }
    public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; }
    public void Multi(out string a, out int b) { var arr = StrArr; a = arr[0]; b = int.Parse(arr[1]); }
    public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; }
    public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); }
    public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; }
    public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; }
    public void Multi(out int a, out long b) { var arr = LongArr; a = (int)arr[0]; b = arr[1]; }
    public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; }
}
class mymath
{
    public bool isprime(long a)
    {
        if (a < 2) return false;
        for (long i = 2; i * i <= a; i++) if (a % i == 0) return false;
        return true;
    }
    public long[][] powmat(long[][] A, long n, int M)
    {
        var E = new long[A.Length][];
        for (int i = 0; i < A.Length; i++)
        {
            E[i] = new long[A.Length];
            E[i][i] = 1;
        }
        if (n == 0) return E;
        var t = powmat(A, n / 2, M);
        if ((n & 1) == 0) return mulmat(t, t, M);
        return mulmat(mulmat(t, t, M), A, M);
    }
    public long[] mulmat(long[][] A, long[] x, int M)
    {
        var ans = new long[A.Length];
        for (int i = 0; i < A.Length; i++) for (int j = 0; j < x.Length; j++) ans[i] = (ans[i] + x[j] * A[i][j]) % M;
        return ans;
    }
    public long[][] mulmat(long[][] A, long[][] B, int M)
    {
        var ans = new long[A.Length][];
        for (int i = 0; i < A.Length; i++)
        {
            ans[i] = new long[B[0].Length];
            for (int j = 0; j < B[0].Length; j++) for (int k = 0; k < B.Length; k++) ans[i][j] = (ans[i][j] + A[i][k] * B[k][j]) % M;
        }
        return ans;
    }
    public long powmod(long a, long b, long M)
    {
        if (a == 0) return 0;
        if (b == 0) return 1;
        var t = powmod(a, b / 2, M);
        if ((b & 1) == 0) return t * t % M;
        return t * t % M * a % M;
    }
    public long gcd(long a, long b)
    {
        while (b > 0) { var t = a % b; a = b; b = t; }
        return a;
    }
    public long lcm(long a, long b) { return a * (b / gcd(a, b)); }
    public long Comb(int n, int r)
    {
        const int M = 1000000007;
        if (n < 0 || r < 0 || r > n) return 0;
        if (n - r < r) r = n - r;
        if (r == 0) return 1;
        if (r == 1) return n;
        var numerator = new int[r];
        var denominator = new int[r];
        for (int k = 0; k < r; k++)
        {
            numerator[k] = n - r + k + 1;
            denominator[k] = k + 1;
        }
        for (int p = 2; p <= r; p++)
        {
            int pivot = denominator[p - 1];
            if (pivot > 1)
            {
                int offset = (n - r) % p;
                for (int k = p - 1; k < r; k += p)
                {
                    numerator[k - offset] /= pivot;
                    denominator[k] /= pivot;
                }
            }
        }
        long result = 1;
        for (int k = 0; k < r; k++) if (numerator[k] > 1) result = result * numerator[k] % M;
        return result;
    }
}
0