Submission #2696442
Source Code Expand
#include <algorithm> #include <bitset> #include <cctype> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <deque> #include <functional> #include <iomanip> #include <iostream> #include <list> #include <map> #include <numeric> #include <set> #include <sstream> #include <stack> #include <string> #include <utility> #include <vector> #define int long long #define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i) #define REPS(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i) #define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i) #define REV(i, a, b) for (int i = (a); i >= (b); --i) #define CLR(a, b) memset((a), (b), sizeof(a)) #define DUMP(x) cout << #x << " = " << (x) << endl; #define INF (3e15) using namespace std; int N, K; int mod = 1e9 + 7; int fac[200005], rev[200005]; int binpow(int x, int p) { if (p == 0) return 1; if (p % 2 == 0) return binpow((x * x) % mod, p / 2); else return (x * binpow(x, p - 1)) % mod; } int nCr(int n, int r) { if (r > n) return 0; return ((fac[n] * rev[r]) % mod * rev[n - r]) % mod; } void precalc(int n) { fac[0] = fac[1] = 1; FOR(i, 2, n + 2) fac[i] = (fac[i - 1] * i) % mod; rev[n + 1] = binpow(fac[n + 1], mod - 2) % mod; REV(i, n, 0) { rev[i] = (rev[i + 1] * (i + 1)) % mod; } } signed main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> N >> K; precalc(N + K); cout << nCr(N + K - 1, K) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 多重ループ |
User | tatsumack |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1634 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 3328 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 | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask0_sample_04.txt | AC | 1 ms | 256 KB |
subtask0_sample_05.txt | AC | 9 ms | 3328 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 1 ms | 256 KB |
subtask1_13.txt | AC | 1 ms | 256 KB |
subtask1_14.txt | AC | 1 ms | 256 KB |
subtask1_15.txt | AC | 1 ms | 256 KB |
subtask1_16.txt | AC | 1 ms | 256 KB |
subtask1_17.txt | AC | 1 ms | 256 KB |
subtask1_18.txt | AC | 1 ms | 256 KB |
subtask1_19.txt | AC | 1 ms | 256 KB |
subtask2_02.txt | AC | 4 ms | 1408 KB |
subtask2_03.txt | AC | 6 ms | 2304 KB |
subtask2_04.txt | AC | 4 ms | 1280 KB |
subtask2_05.txt | AC | 7 ms | 2816 KB |
subtask2_06.txt | AC | 2 ms | 768 KB |
subtask2_07.txt | AC | 5 ms | 1792 KB |
subtask2_08.txt | AC | 7 ms | 2560 KB |
subtask2_09.txt | AC | 5 ms | 1792 KB |
subtask2_10.txt | AC | 9 ms | 3328 KB |