結果
問題 | No.389 ロジックパズルの組み合わせ |
ユーザー | AreTrash |
提出日時 | 2018-03-15 14:00:59 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 182 ms / 2,000 ms |
コード長 | 4,345 bytes |
コンパイル時間 | 3,488 ms |
コンパイル使用メモリ | 106,364 KB |
実行使用メモリ | 48,908 KB |
最終ジャッジ日時 | 2023-08-22 12:46:54 |
合計ジャッジ時間 | 15,695 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 62 ms
21,628 KB |
testcase_01 | AC | 60 ms
21,576 KB |
testcase_02 | AC | 61 ms
23,608 KB |
testcase_03 | AC | 59 ms
21,644 KB |
testcase_04 | AC | 84 ms
26,160 KB |
testcase_05 | AC | 59 ms
19,556 KB |
testcase_06 | AC | 58 ms
23,804 KB |
testcase_07 | AC | 58 ms
21,636 KB |
testcase_08 | AC | 58 ms
21,644 KB |
testcase_09 | AC | 105 ms
28,588 KB |
testcase_10 | AC | 79 ms
24,928 KB |
testcase_11 | AC | 109 ms
28,940 KB |
testcase_12 | AC | 77 ms
22,516 KB |
testcase_13 | AC | 144 ms
35,740 KB |
testcase_14 | AC | 86 ms
25,908 KB |
testcase_15 | AC | 80 ms
22,800 KB |
testcase_16 | AC | 89 ms
24,644 KB |
testcase_17 | AC | 100 ms
28,952 KB |
testcase_18 | AC | 167 ms
45,744 KB |
testcase_19 | AC | 61 ms
23,840 KB |
testcase_20 | AC | 61 ms
23,636 KB |
testcase_21 | AC | 61 ms
21,672 KB |
testcase_22 | AC | 62 ms
23,692 KB |
testcase_23 | AC | 61 ms
23,640 KB |
testcase_24 | AC | 61 ms
21,696 KB |
testcase_25 | AC | 68 ms
21,772 KB |
testcase_26 | AC | 61 ms
21,696 KB |
testcase_27 | AC | 67 ms
19,692 KB |
testcase_28 | AC | 60 ms
21,716 KB |
testcase_29 | AC | 63 ms
21,672 KB |
testcase_30 | AC | 62 ms
23,660 KB |
testcase_31 | AC | 61 ms
21,700 KB |
testcase_32 | AC | 62 ms
21,760 KB |
testcase_33 | AC | 62 ms
23,632 KB |
testcase_34 | AC | 62 ms
23,756 KB |
testcase_35 | AC | 62 ms
19,656 KB |
testcase_36 | AC | 62 ms
21,636 KB |
testcase_37 | AC | 62 ms
23,680 KB |
testcase_38 | AC | 59 ms
19,592 KB |
testcase_39 | AC | 60 ms
21,560 KB |
testcase_40 | AC | 62 ms
23,668 KB |
testcase_41 | AC | 62 ms
21,632 KB |
testcase_42 | AC | 62 ms
21,588 KB |
testcase_43 | AC | 61 ms
21,600 KB |
testcase_44 | AC | 60 ms
21,708 KB |
testcase_45 | AC | 60 ms
21,596 KB |
testcase_46 | AC | 62 ms
23,632 KB |
testcase_47 | AC | 60 ms
21,712 KB |
testcase_48 | AC | 61 ms
21,628 KB |
testcase_49 | AC | 143 ms
37,316 KB |
testcase_50 | AC | 69 ms
22,184 KB |
testcase_51 | AC | 70 ms
24,192 KB |
testcase_52 | AC | 78 ms
23,552 KB |
testcase_53 | AC | 73 ms
24,616 KB |
testcase_54 | AC | 82 ms
23,884 KB |
testcase_55 | AC | 67 ms
23,960 KB |
testcase_56 | AC | 73 ms
24,484 KB |
testcase_57 | AC | 98 ms
27,596 KB |
testcase_58 | AC | 133 ms
39,908 KB |
testcase_59 | AC | 118 ms
37,656 KB |
testcase_60 | AC | 86 ms
26,160 KB |
testcase_61 | AC | 182 ms
48,908 KB |
testcase_62 | AC | 88 ms
28,324 KB |
testcase_63 | AC | 134 ms
40,256 KB |
testcase_64 | AC | 80 ms
23,788 KB |
testcase_65 | AC | 74 ms
20,660 KB |
testcase_66 | AC | 84 ms
23,908 KB |
testcase_67 | AC | 83 ms
23,936 KB |
testcase_68 | AC | 83 ms
27,844 KB |
testcase_69 | AC | 87 ms
26,360 KB |
testcase_70 | AC | 79 ms
25,076 KB |
testcase_71 | AC | 73 ms
25,324 KB |
testcase_72 | AC | 91 ms
29,488 KB |
testcase_73 | AC | 74 ms
23,656 KB |
testcase_74 | AC | 73 ms
25,536 KB |
testcase_75 | AC | 73 ms
21,412 KB |
testcase_76 | AC | 79 ms
24,940 KB |
testcase_77 | AC | 78 ms
26,796 KB |
testcase_78 | AC | 69 ms
22,468 KB |
testcase_79 | AC | 71 ms
23,244 KB |
testcase_80 | AC | 65 ms
22,308 KB |
testcase_81 | AC | 61 ms
21,760 KB |
testcase_82 | AC | 88 ms
27,092 KB |
testcase_83 | AC | 76 ms
23,956 KB |
testcase_84 | AC | 68 ms
24,720 KB |
testcase_85 | AC | 94 ms
25,888 KB |
testcase_86 | AC | 91 ms
27,140 KB |
testcase_87 | AC | 64 ms
21,672 KB |
testcase_88 | AC | 61 ms
23,576 KB |
testcase_89 | AC | 108 ms
31,760 KB |
testcase_90 | AC | 151 ms
42,480 KB |
testcase_91 | AC | 172 ms
44,548 KB |
testcase_92 | AC | 87 ms
24,232 KB |
testcase_93 | AC | 144 ms
40,336 KB |
testcase_94 | AC | 92 ms
26,296 KB |
testcase_95 | AC | 141 ms
39,056 KB |
testcase_96 | AC | 137 ms
35,336 KB |
testcase_97 | AC | 131 ms
34,100 KB |
testcase_98 | AC | 117 ms
32,128 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.IO; using System.Collections.Generic; using System.Linq; namespace No389_1 { public class Program { void Solve(StreamWriter sw) { //--------------------------------- var M = int.Parse(Console.ReadLine()); var H = Console.ReadLine().Split(new []{' '}, StringSplitOptions.RemoveEmptyEntries).Select(int.Parse).ToArray(); var K = H.Length; if (K == 1 && H[0] == 0) { sw.WriteLine(1); return; } if (M < H.Sum() + K - 1) { sw.WriteLine("NA"); return; } var comb = new Combination(M); sw.WriteLine(comb.NCK(M - H.Sum() + 1, K)); //--------------------------------- } static void Main() { var sw = new StreamWriter(Console.OpenStandardOutput()) {AutoFlush = false}; new Program().Solve(sw); sw.Flush(); } } public static partial class MathX { public static int GcdEx(int a, int b, out int x, out int y) { if (b == 0) { x = 1; y = 0; return a; } int tx, ty; var gcd = GcdEx(b, a % b, out tx, out ty); x = ty; y = tx - ty * (a / b); return gcd; } } public struct ModInt { public static int Mod = 1000000007; readonly long value; public int Value { get { return (int)value; } } public ModInt Inverse { get { return GetInverse(); } } public ModInt(long value) { value %= Mod; this.value = value < 0 ? value + Mod : value; } ModInt GetInverse() { int x, y; if (MathX.GcdEx(Value, Mod, out x, out y) != 1) { throw new InvalidOperationException("'Value' and 'Mod' must be disjoint."); } return x; } public ModInt Square() { return this * this; } public ModInt Pow(long exp) { if (exp == 0) return 1; if (exp % 2 == 0) return Pow(exp / 2).Square(); return this * Pow(exp - 1); } public static ModInt Parse(string str) { return long.Parse(str); } public static implicit operator ModInt(long value) { return new ModInt(value); } public static ModInt operator +(ModInt left, ModInt right) { return left.value + right.value; } public static ModInt operator -(ModInt left, ModInt right) { return left.value - right.value; } public static ModInt operator *(ModInt left, ModInt right) { return left.value * right.value; } public static ModInt operator /(ModInt left, ModInt right) { return left * right.Inverse; } public override bool Equals(object obj) { if (!(obj is ModInt)) return false; return value == ((ModInt)obj).value; } public override int GetHashCode() { return value.GetHashCode(); } public override string ToString() { return value.ToString(); } } public class Combination { readonly ModInt[] facts; public Combination(int max) { facts = new ModInt[max + 1]; facts[0] = 1; for (var i = 1; i <= max; i++) facts[i] = facts[i - 1] * i; } public ModInt Fact(int n) { return facts[n]; } public ModInt NCK(int n, int k) { if (n < k) return 0; return facts[n] / facts[k] / facts[n - k]; } public ModInt NPK(int n, int k) { if (n < k) return 0; return facts[n] / facts[n - k]; } public ModInt NHK(int n, int k) { if (k == 0) return 1; if (n == 0) return 0; return facts[n + k - 1] / facts[k] / facts[n - 1]; } } }