Submission #5333787
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; ll Solve() { constexpr ll MOD = 1e9 + 7; ll n, k; cin >> n >> k; if (k == n || (n < k && (k % n == 0))) return 1; vector<vector<ll>> comb(n + k, vector<ll>(n + k)); comb[0][0] = 1; for (int i = 1; i < n + k; ++i) { for (int j = 0; j <= i; ++j) { if (j != 0) (comb[i][j] += comb[i - 1][j - 1]) %= MOD; (comb[i][j] += comb[i - 1][j]) %= MOD; } } if (k < n) return comb[n + k - 1][k]; else return comb[n][k % n]; } int main() { cin.tie(0); ios::sync_with_stdio(false); // cout << setprecision(8) << setiosflags(ios::fixed); cout << Solve() << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 高橋幼稚園 |
User | pqwmL769 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 792 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 2816 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 | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 3 ms | 2688 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 2 ms | 1024 KB |
subtask1_03.txt | AC | 2 ms | 1152 KB |
subtask1_04.txt | AC | 2 ms | 1408 KB |
subtask1_05.txt | AC | 1 ms | 640 KB |
subtask1_06.txt | AC | 2 ms | 1408 KB |
subtask1_07.txt | AC | 3 ms | 2816 KB |
subtask1_08.txt | AC | 2 ms | 1664 KB |
subtask1_09.txt | AC | 2 ms | 1664 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 2 ms | 1536 KB |
subtask1_12.txt | AC | 1 ms | 256 KB |
subtask1_13.txt | AC | 2 ms | 1536 KB |
subtask1_14.txt | AC | 2 ms | 896 KB |
subtask1_15.txt | AC | 2 ms | 1792 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_01.txt | AC | 1 ms | 256 KB |
subtask2_02.txt | AC | 1 ms | 256 KB |
subtask2_03.txt | AC | 1 ms | 384 KB |
subtask2_04.txt | AC | 1 ms | 384 KB |
subtask2_05.txt | AC | 1 ms | 384 KB |
subtask2_06.txt | AC | 1 ms | 256 KB |
subtask2_07.txt | AC | 1 ms | 256 KB |
subtask2_08.txt | AC | 1 ms | 384 KB |
subtask2_09.txt | AC | 1 ms | 256 KB |
subtask2_10.txt | AC | 1 ms | 384 KB |
subtask2_11.txt | AC | 1 ms | 384 KB |