Submission #3784990
Source Code Expand
#include <bits/stdc++.h> #define REP(i, n) for(int i = 0;i < n;i++) #define REPR(i, n) for(int i = n;i >= 0;i--) #define FOR(i, m, n) for(int i = m;i < n;i++) #define FORR(i, m, n) for(int i = m;i >= n;i--) #define SORT(v, n) sort(v, v+n); #define VSORT(v) sort(v.begin(), v.end()); #define VRSORT(v) sort(v.rbegin(), v.rend());//vectorの降順ソート #define ll long long #define pb(a) push_back(a) #define INF 1000000000 #define MOD 1000000007 using namespace std; typedef pair<int, int> P; typedef pair<ll, ll> LP; typedef pair<int, P> PP; typedef pair<ll, LP> LPP; int dy[]={0, 0, 1, -1, 0}; int dx[]={1, -1, 0, 0, 0}; const int MAX = 510000; long long fac[MAX], finv[MAX], inv[MAX]; // テーブルを作る前処理 void comb_init() { fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (int i = 2; i < MAX; i++){ fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } // 二項係数計算 long long comb(int n, int k){ if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD; } int main(){ cin.tie(0); ios::sync_with_stdio(false); int n,k; cin >> n >> k; comb_init(); cout << comb(n+k-1,k) << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - 多重ループ |
User | Bondo416 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1364 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 12160 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 99 / 99 | 1 / 1 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt |
Subtask1 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 12 ms | 12160 KB |
subtask0_sample_02.txt | AC | 12 ms | 12160 KB |
subtask0_sample_03.txt | AC | 12 ms | 12160 KB |
subtask0_sample_04.txt | AC | 12 ms | 12160 KB |
subtask0_sample_05.txt | AC | 12 ms | 12160 KB |
subtask1_01.txt | AC | 12 ms | 12160 KB |
subtask1_02.txt | AC | 12 ms | 12160 KB |
subtask1_03.txt | AC | 12 ms | 12160 KB |
subtask1_04.txt | AC | 12 ms | 12160 KB |
subtask1_05.txt | AC | 12 ms | 12160 KB |
subtask1_06.txt | AC | 12 ms | 12160 KB |
subtask1_07.txt | AC | 12 ms | 12160 KB |
subtask1_08.txt | AC | 12 ms | 12160 KB |
subtask1_09.txt | AC | 12 ms | 12160 KB |
subtask1_10.txt | AC | 12 ms | 12160 KB |
subtask1_11.txt | AC | 12 ms | 12160 KB |
subtask1_12.txt | AC | 12 ms | 12160 KB |
subtask1_13.txt | AC | 12 ms | 12160 KB |
subtask1_14.txt | AC | 12 ms | 12160 KB |
subtask1_15.txt | AC | 12 ms | 12160 KB |
subtask1_16.txt | AC | 12 ms | 12160 KB |
subtask1_17.txt | AC | 12 ms | 12160 KB |
subtask1_18.txt | AC | 12 ms | 12160 KB |
subtask1_19.txt | AC | 12 ms | 12160 KB |
subtask2_02.txt | AC | 12 ms | 12160 KB |
subtask2_03.txt | AC | 12 ms | 12160 KB |
subtask2_04.txt | AC | 12 ms | 12160 KB |
subtask2_05.txt | AC | 12 ms | 12160 KB |
subtask2_06.txt | AC | 12 ms | 12160 KB |
subtask2_07.txt | AC | 12 ms | 12160 KB |
subtask2_08.txt | AC | 12 ms | 12160 KB |
subtask2_09.txt | AC | 12 ms | 12160 KB |
subtask2_10.txt | AC | 12 ms | 12160 KB |