Submission #5333749
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; struct ModComb { vector<long long> fac; vector<long long> ifac; const long long MOD = 1000000007; template <typename T> T power(T a, T b) { T ret = 1; while (b > 0) { if (b&1) { (ret *= a) %= MOD; } (a *= a) %= MOD; b >>= 1; } return ret; } ModComb(const size_t SIZE) { fac.assign(SIZE, 0); ifac.assign(SIZE, 0); fac[0] = ifac[0] = 1; for (int i = 1; i < SIZE; ++i) { fac[i] = (fac[i - 1] * i) % MOD; ifac[i] = power(fac[i], MOD - 2) % MOD; } } long long nCr(size_t n, size_t r) { return (((fac[n] * ifac[r]) % MOD) * ifac[n - r]) % MOD; } }; int main() { const ll MOD = 1e9 + 7; ll N, K; cin >> N >> K; ModComb Comb(1000); if (K < N) { cout << Comb.nCr(K + N - 1, K) % MOD << endl; } else { cout << Comb.nCr(N, K % N) % MOD << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 高橋幼稚園 |
User | woodline23xx |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 925 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 80 / 80 | 20 / 20 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
Subtask1 | subtask0_sample_01.txt, subtask0_sample_02.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 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.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_01.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, subtask2_11.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 2 ms | 256 KB |
subtask0_sample_02.txt | AC | 2 ms | 256 KB |
subtask0_sample_03.txt | AC | 2 ms | 256 KB |
subtask1_01.txt | AC | 2 ms | 256 KB |
subtask1_02.txt | AC | 2 ms | 256 KB |
subtask1_03.txt | AC | 2 ms | 256 KB |
subtask1_04.txt | AC | 2 ms | 256 KB |
subtask1_05.txt | AC | 2 ms | 256 KB |
subtask1_06.txt | AC | 2 ms | 256 KB |
subtask1_07.txt | AC | 2 ms | 256 KB |
subtask1_08.txt | AC | 2 ms | 256 KB |
subtask1_09.txt | AC | 2 ms | 256 KB |
subtask1_10.txt | AC | 2 ms | 256 KB |
subtask1_11.txt | AC | 2 ms | 256 KB |
subtask1_12.txt | AC | 2 ms | 256 KB |
subtask1_13.txt | AC | 2 ms | 256 KB |
subtask1_14.txt | AC | 2 ms | 256 KB |
subtask1_15.txt | AC | 2 ms | 256 KB |
subtask1_16.txt | AC | 2 ms | 256 KB |
subtask1_17.txt | AC | 2 ms | 256 KB |
subtask1_18.txt | AC | 2 ms | 256 KB |
subtask1_19.txt | AC | 2 ms | 256 KB |
subtask2_01.txt | AC | 2 ms | 256 KB |
subtask2_02.txt | AC | 2 ms | 256 KB |
subtask2_03.txt | AC | 2 ms | 256 KB |
subtask2_04.txt | AC | 2 ms | 256 KB |
subtask2_05.txt | AC | 2 ms | 256 KB |
subtask2_06.txt | AC | 2 ms | 256 KB |
subtask2_07.txt | AC | 2 ms | 256 KB |
subtask2_08.txt | AC | 2 ms | 256 KB |
subtask2_09.txt | AC | 2 ms | 256 KB |
subtask2_10.txt | AC | 2 ms | 256 KB |
subtask2_11.txt | AC | 2 ms | 256 KB |