結果

問題 No.389 ロジックパズルの組み合わせ
ユーザー kissshot7kissshot7
提出日時 2020-09-25 11:47:47
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 51 ms / 2,000 ms
コード長 3,474 bytes
コンパイル時間 1,738 ms
コンパイル使用メモリ 174,276 KB
実行使用メモリ 40,256 KB
最終ジャッジ日時 2023-09-10 14:30:14
合計ジャッジ時間 9,845 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 18 ms
19,844 KB
testcase_01 AC 18 ms
19,732 KB
testcase_02 AC 18 ms
19,800 KB
testcase_03 AC 17 ms
19,772 KB
testcase_04 AC 18 ms
19,780 KB
testcase_05 AC 18 ms
19,736 KB
testcase_06 AC 18 ms
19,740 KB
testcase_07 AC 19 ms
19,896 KB
testcase_08 AC 18 ms
19,748 KB
testcase_09 AC 22 ms
21,692 KB
testcase_10 AC 21 ms
20,880 KB
testcase_11 AC 23 ms
21,772 KB
testcase_12 AC 20 ms
20,604 KB
testcase_13 AC 32 ms
29,204 KB
testcase_14 AC 23 ms
21,916 KB
testcase_15 AC 21 ms
20,544 KB
testcase_16 AC 20 ms
20,632 KB
testcase_17 AC 23 ms
21,760 KB
testcase_18 AC 46 ms
39,816 KB
testcase_19 AC 18 ms
19,744 KB
testcase_20 AC 18 ms
19,844 KB
testcase_21 AC 18 ms
19,836 KB
testcase_22 AC 18 ms
19,760 KB
testcase_23 AC 18 ms
19,868 KB
testcase_24 AC 18 ms
19,748 KB
testcase_25 AC 18 ms
19,960 KB
testcase_26 AC 18 ms
19,760 KB
testcase_27 AC 18 ms
20,044 KB
testcase_28 AC 18 ms
19,820 KB
testcase_29 AC 19 ms
19,744 KB
testcase_30 AC 18 ms
19,752 KB
testcase_31 AC 18 ms
19,780 KB
testcase_32 AC 18 ms
19,732 KB
testcase_33 AC 18 ms
19,992 KB
testcase_34 AC 18 ms
19,824 KB
testcase_35 AC 18 ms
20,016 KB
testcase_36 AC 19 ms
19,876 KB
testcase_37 AC 18 ms
19,740 KB
testcase_38 AC 19 ms
19,764 KB
testcase_39 AC 18 ms
19,756 KB
testcase_40 AC 19 ms
19,848 KB
testcase_41 AC 18 ms
19,740 KB
testcase_42 AC 18 ms
19,756 KB
testcase_43 AC 19 ms
19,824 KB
testcase_44 AC 19 ms
19,748 KB
testcase_45 AC 19 ms
19,764 KB
testcase_46 AC 18 ms
19,872 KB
testcase_47 AC 18 ms
19,944 KB
testcase_48 AC 18 ms
19,768 KB
testcase_49 AC 48 ms
40,256 KB
testcase_50 AC 20 ms
20,296 KB
testcase_51 AC 20 ms
20,224 KB
testcase_52 AC 24 ms
21,924 KB
testcase_53 AC 21 ms
20,716 KB
testcase_54 AC 25 ms
22,016 KB
testcase_55 AC 18 ms
19,908 KB
testcase_56 AC 20 ms
20,600 KB
testcase_57 AC 31 ms
28,708 KB
testcase_58 AC 43 ms
38,132 KB
testcase_59 AC 34 ms
29,448 KB
testcase_60 AC 26 ms
24,744 KB
testcase_61 AC 51 ms
39,836 KB
testcase_62 AC 26 ms
24,376 KB
testcase_63 AC 43 ms
38,828 KB
testcase_64 AC 25 ms
22,060 KB
testcase_65 AC 23 ms
21,740 KB
testcase_66 AC 26 ms
25,352 KB
testcase_67 AC 27 ms
25,284 KB
testcase_68 AC 26 ms
24,504 KB
testcase_69 AC 18 ms
19,748 KB
testcase_70 AC 18 ms
19,816 KB
testcase_71 AC 18 ms
19,732 KB
testcase_72 AC 18 ms
19,752 KB
testcase_73 AC 18 ms
19,820 KB
testcase_74 AC 18 ms
19,820 KB
testcase_75 AC 18 ms
19,904 KB
testcase_76 AC 18 ms
19,748 KB
testcase_77 AC 18 ms
19,844 KB
testcase_78 AC 18 ms
19,816 KB
testcase_79 AC 18 ms
19,776 KB
testcase_80 AC 18 ms
19,744 KB
testcase_81 AC 18 ms
20,000 KB
testcase_82 AC 18 ms
19,872 KB
testcase_83 AC 18 ms
19,748 KB
testcase_84 AC 18 ms
19,736 KB
testcase_85 AC 18 ms
19,744 KB
testcase_86 AC 18 ms
19,992 KB
testcase_87 AC 18 ms
19,732 KB
testcase_88 AC 18 ms
19,840 KB
testcase_89 AC 28 ms
26,380 KB
testcase_90 AC 33 ms
29,532 KB
testcase_91 AC 44 ms
38,828 KB
testcase_92 AC 22 ms
21,772 KB
testcase_93 AC 35 ms
30,396 KB
testcase_94 AC 18 ms
19,904 KB
testcase_95 AC 35 ms
29,480 KB
testcase_96 AC 32 ms
29,656 KB
testcase_97 AC 32 ms
29,628 KB
testcase_98 AC 26 ms
24,616 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

//逆元(Eucledean algorithm)
ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };


vector<string> split(string str, string separator) {
    if (separator == "") return {str};
    vector<string> result;
    string tstr = str + separator;
    long l = tstr.length(), sl = separator.length();
    string::size_type pos = 0, prev = 0;
    
    for (;pos < l && (pos = tstr.find(separator, pos)) != string::npos; prev = (pos += sl)) {
        result.emplace_back(tstr, prev, pos - prev);
    }
    return result;
}

void solve() {
    string ns; getline(cin, ns);
    string hs; getline(cin, hs);
    if(hs == "0"){
        cout << 1 << endl;
        return;
    }
    int n = stoi(ns);
    auto sv = split(hs, " ");
    int cnt = sv.size();
    vec v(cnt);
    rep(i, cnt){
        v[i] = stoi(sv[i]);
    }
    int d = n - (accumulate(all(v), 0) + cnt - 1);
    if(d < 0){
        cout << "NA" << endl;
        return;
    }
    
    cout << comb(d + cnt, cnt).n << endl;
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  //cout << fixed << setprecision(10);
  init_f();
  //init();
  //int t; cin >> t; rep(i, t)solve();
  solve();
//   stop
    return 0;
}
0