結果

問題 No.389 ロジックパズルの組み合わせ
ユーザー tancahn2380tancahn2380
提出日時 2018-04-07 12:27:49
言語 C++11
(gcc 11.4.0)
結果
WA  
実行時間 -
コード長 2,390 bytes
コンパイル時間 1,298 ms
コンパイル使用メモリ 105,956 KB
実行使用メモリ 13,772 KB
最終ジャッジ日時 2024-06-26 11:00:39
合計ジャッジ時間 8,838 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
12,800 KB
testcase_01 WA -
testcase_02 AC 23 ms
12,800 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 RE -
testcase_05 WA -
testcase_06 WA -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 AC 32 ms
13,056 KB
testcase_11 RE -
testcase_12 AC 29 ms
12,928 KB
testcase_13 AC 51 ms
13,264 KB
testcase_14 AC 33 ms
12,900 KB
testcase_15 AC 27 ms
12,928 KB
testcase_16 AC 28 ms
12,868 KB
testcase_17 RE -
testcase_18 AC 72 ms
13,772 KB
testcase_19 AC 25 ms
12,672 KB
testcase_20 AC 26 ms
12,668 KB
testcase_21 AC 24 ms
12,672 KB
testcase_22 AC 26 ms
12,784 KB
testcase_23 AC 27 ms
12,776 KB
testcase_24 AC 26 ms
12,800 KB
testcase_25 AC 26 ms
12,672 KB
testcase_26 AC 25 ms
12,800 KB
testcase_27 AC 25 ms
12,800 KB
testcase_28 AC 26 ms
12,800 KB
testcase_29 AC 25 ms
12,680 KB
testcase_30 AC 25 ms
12,672 KB
testcase_31 AC 26 ms
12,792 KB
testcase_32 AC 25 ms
12,704 KB
testcase_33 AC 27 ms
12,688 KB
testcase_34 AC 25 ms
12,800 KB
testcase_35 AC 23 ms
12,696 KB
testcase_36 AC 26 ms
12,800 KB
testcase_37 AC 25 ms
12,928 KB
testcase_38 AC 26 ms
12,676 KB
testcase_39 AC 24 ms
12,672 KB
testcase_40 AC 25 ms
12,708 KB
testcase_41 AC 25 ms
12,672 KB
testcase_42 AC 24 ms
12,748 KB
testcase_43 AC 25 ms
12,692 KB
testcase_44 AC 25 ms
12,684 KB
testcase_45 AC 25 ms
12,684 KB
testcase_46 AC 25 ms
12,780 KB
testcase_47 AC 26 ms
12,672 KB
testcase_48 AC 26 ms
12,672 KB
testcase_49 AC 50 ms
5,376 KB
testcase_50 AC 5 ms
5,376 KB
testcase_51 AC 4 ms
5,376 KB
testcase_52 AC 11 ms
5,376 KB
testcase_53 AC 6 ms
5,376 KB
testcase_54 AC 13 ms
5,376 KB
testcase_55 AC 3 ms
5,376 KB
testcase_56 AC 5 ms
5,376 KB
testcase_57 AC 23 ms
5,376 KB
testcase_58 AC 43 ms
5,376 KB
testcase_59 AC 33 ms
5,376 KB
testcase_60 AC 16 ms
5,376 KB
testcase_61 AC 67 ms
5,376 KB
testcase_62 AC 16 ms
5,376 KB
testcase_63 AC 44 ms
5,452 KB
testcase_64 AC 13 ms
5,376 KB
testcase_65 AC 8 ms
5,376 KB
testcase_66 AC 14 ms
5,376 KB
testcase_67 AC 13 ms
5,376 KB
testcase_68 AC 14 ms
5,376 KB
testcase_69 AC 26 ms
12,672 KB
testcase_70 AC 24 ms
12,672 KB
testcase_71 AC 24 ms
12,672 KB
testcase_72 AC 23 ms
12,672 KB
testcase_73 AC 25 ms
12,800 KB
testcase_74 AC 24 ms
12,672 KB
testcase_75 AC 25 ms
12,788 KB
testcase_76 AC 24 ms
12,672 KB
testcase_77 RE -
testcase_78 AC 27 ms
12,672 KB
testcase_79 AC 26 ms
12,544 KB
testcase_80 AC 25 ms
12,672 KB
testcase_81 AC 27 ms
12,672 KB
testcase_82 AC 25 ms
12,672 KB
testcase_83 AC 26 ms
12,800 KB
testcase_84 AC 27 ms
12,672 KB
testcase_85 AC 25 ms
12,672 KB
testcase_86 AC 25 ms
12,656 KB
testcase_87 AC 25 ms
12,656 KB
testcase_88 AC 25 ms
12,800 KB
testcase_89 AC 41 ms
13,132 KB
testcase_90 AC 52 ms
13,260 KB
testcase_91 AC 73 ms
13,772 KB
testcase_92 AC 32 ms
13,024 KB
testcase_93 AC 56 ms
13,392 KB
testcase_94 AC 26 ms
12,884 KB
testcase_95 AC 57 ms
13,576 KB
testcase_96 AC 51 ms
13,260 KB
testcase_97 AC 49 ms
13,132 KB
testcase_98 AC 37 ms
13,024 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <numeric>
# include <complex>
# include <bitset>
# include <random>
# include <chrono>
# include <cstdlib>
# include <tuple>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr int INF = 2147483647;
constexpr int HINF = INF / 2;
constexpr double DINF = 100000000000000000.0;
constexpr double HDINF = 50000000000000000.0;
constexpr long long LINF = 9223372036854775807;
constexpr long long HLINF = 4500000000000000000;
const double PI = acos(-1);
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
# define ALL(x)      (x).begin(),(x).end()
# define UNIQ(c)     (c).erase(unique(ALL((c))),(c).end())
# define LOWER(s)    transform(ALL((s)),(s).begin(),TL<char>)
# define UPPER(s)    transform(ALL((s)),(s).begin(),TU<char>)
# define FOR(i,a,b)  for(LL i=(a);i<(b);i++)
# define RFOR(i,a,b) for(LL i=(a);i>=(b);i--)
# define REP(i,n)    FOR(i,0,n)
# define INIT        std::ios::sync_with_stdio(false);std::cin.tie(0)

LL MOD = 1000000007;
LL combi(LL N_, LL C_) {
	const int NUM_ = 400001;
	static LL fact[NUM_ + 1], factr[NUM_ + 1], inv[NUM_ + 1];
	if (fact[0] == 0) {
		inv[1] = fact[0] = factr[0] = 1;
		for (int i = 2; i <= NUM_; ++i) inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
		for (int i = 1; i <= NUM_; ++i) fact[i] = fact[i - 1] * i%MOD, factr[i] = factr[i - 1] * inv[i] % MOD;
	}
	if (C_<0 || C_>N_) return 0;
	return factr[C_] * fact[N_] % MOD*factr[N_ - C_] % MOD;
}
LL hcomb(int P_, int Q_) { return (P_ == 0 && Q_ == 0) ? 1 : combi(P_ + Q_ - 1, Q_); }

LL modpow(LL a, LL n = MOD - 2) {
	LL r = 1;
	while (n) r = r*((n % 2) ? a : 1) % MOD, a = a*a%MOD, n >>= 1;
	return r;
}
 
vector<int>h;
int sum = 0;
int main() {
	int m;
	cin >> m;
	int n;
	while (cin >> n) {
		h.emplace_back(n);
		sum += n;
	}
	if (sum + h.size()-1> m) {
		cout << "NA" << endl;
		return 0;
	}
	if (sum == 0) {
		cout << 1 << endl;
	}
	int num = m - (sum + h.size() - 1);
	cout << (combi(num + h.size(), h.size())) << endl;
}
0