Submission #1303067
Source Code Expand
#include<cstdio> #include <iostream> #include<algorithm> #include<string> #include<queue> #include<vector> #include<functional> #include<cmath> #include<map> #include<stack> #include<set> using namespace std; typedef long long ll; typedef pair<ll, ll> P; const ll MOD = 1000000007; ll table[510][510]; void combination() { for (int i = 0; i < 510; i++) { for (int j = 0; j <= i; j++) { if (j == 0 || j == i) { table[i][j] = 1LL; } else { table[i][j] = table[i - 1][j - 1] + table[i - 1][j]; table[i][j] %= MOD; } } } } int main() { int N, M; cin >> N >> M; if (M >= N) { combination(); cout << table[N][M % N] << endl; } else cout << table[N + M - 1][M] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 高橋幼稚園 |
User | jj |
Language | C++14 (GCC 5.4.1) |
Score | 80 |
Code Size | 770 Byte |
Status | WA |
Exec Time | 3 ms |
Memory | 2432 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 80 / 80 | 0 / 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 | 3 ms | 2432 KB |
subtask0_sample_02.txt | AC | 2 ms | 2304 KB |
subtask0_sample_03.txt | WA | 1 ms | 256 KB |
subtask1_01.txt | AC | 2 ms | 2304 KB |
subtask1_02.txt | AC | 2 ms | 2304 KB |
subtask1_03.txt | AC | 2 ms | 2304 KB |
subtask1_04.txt | AC | 2 ms | 2304 KB |
subtask1_05.txt | AC | 2 ms | 2304 KB |
subtask1_06.txt | AC | 2 ms | 2304 KB |
subtask1_07.txt | AC | 2 ms | 2304 KB |
subtask1_08.txt | AC | 2 ms | 2304 KB |
subtask1_09.txt | AC | 2 ms | 2304 KB |
subtask1_10.txt | AC | 2 ms | 2304 KB |
subtask1_11.txt | AC | 2 ms | 2304 KB |
subtask1_12.txt | AC | 2 ms | 2304 KB |
subtask1_13.txt | AC | 2 ms | 2304 KB |
subtask1_14.txt | AC | 2 ms | 2304 KB |
subtask1_15.txt | AC | 2 ms | 2304 KB |
subtask1_16.txt | AC | 2 ms | 2304 KB |
subtask1_17.txt | AC | 2 ms | 2304 KB |
subtask1_18.txt | AC | 2 ms | 2304 KB |
subtask1_19.txt | AC | 2 ms | 2304 KB |
subtask2_01.txt | WA | 1 ms | 256 KB |
subtask2_02.txt | WA | 1 ms | 256 KB |
subtask2_03.txt | WA | 1 ms | 256 KB |
subtask2_04.txt | WA | 1 ms | 256 KB |
subtask2_05.txt | WA | 1 ms | 256 KB |
subtask2_06.txt | WA | 1 ms | 256 KB |
subtask2_07.txt | WA | 1 ms | 256 KB |
subtask2_08.txt | WA | 1 ms | 256 KB |
subtask2_09.txt | WA | 1 ms | 256 KB |
subtask2_10.txt | WA | 1 ms | 256 KB |
subtask2_11.txt | WA | 1 ms | 256 KB |