Submission #3387667
Source Code Expand
#include <bits/stdc++.h>
#define For(i, j, k) for (int i = j; i <= k; ++ i)
#define Forr(i, j, k) for (int i = j; i >= k; -- i)
using namespace std;
inline int read() {
int x = 0, p = 1; char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') p = -1;
for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
return x * p;
}
inline void File() {
freopen("C.in", "r", stdin);
freopen("C.out", "w", stdout);
}
const int N = 50 + 2;
int n, s, a[N], dp[N][N][N * N], mx;
int main() {
n = read(), s = read();
For(i, 1, n) mx += a[i] = read();
dp[0][0][0] = 1;
For(i, 1, n) For(j, 0, i) For(k, 0, mx) {
if (j && k >= a[i]) dp[i][j][k] += dp[i - 1][j - 1][k - a[i]];
dp[i][j][k] += dp[i - 1][j][k];
}
int ans = 0;
For(i, 1, n) ans += dp[n][i][i * s];
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Tak and Cards |
User |
LSTete |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
871 Byte |
Status |
WA |
Exec Time |
15 ms |
Memory |
26240 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
0 / 100 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
example_01.txt, example_02.txt, example_03.txt, example_04.txt |
Subtask1 |
example_01.txt, example_02.txt, example_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 |
All |
example_01.txt, example_02.txt, example_03.txt, example_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, 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 |
example_01.txt |
AC |
2 ms |
2304 KB |
example_02.txt |
AC |
1 ms |
256 KB |
example_03.txt |
AC |
2 ms |
4352 KB |
example_04.txt |
WA |
5 ms |
18688 KB |
subtask1_01.txt |
AC |
3 ms |
8448 KB |
subtask1_02.txt |
AC |
3 ms |
8448 KB |
subtask1_03.txt |
AC |
3 ms |
8448 KB |
subtask1_04.txt |
AC |
2 ms |
8448 KB |
subtask1_05.txt |
AC |
3 ms |
8448 KB |
subtask1_06.txt |
AC |
1 ms |
256 KB |
subtask1_07.txt |
AC |
1 ms |
256 KB |
subtask1_08.txt |
AC |
2 ms |
8448 KB |
subtask1_09.txt |
AC |
3 ms |
8448 KB |
subtask2_01.txt |
WA |
10 ms |
25984 KB |
subtask2_02.txt |
AC |
11 ms |
25984 KB |
subtask2_03.txt |
WA |
10 ms |
25600 KB |
subtask2_04.txt |
WA |
15 ms |
26240 KB |
subtask2_05.txt |
AC |
15 ms |
26240 KB |
subtask2_06.txt |
AC |
7 ms |
25344 KB |
subtask2_07.txt |
AC |
11 ms |
25984 KB |
subtask2_08.txt |
AC |
6 ms |
18688 KB |
subtask2_09.txt |
AC |
7 ms |
18688 KB |
subtask2_10.txt |
AC |
9 ms |
22912 KB |
subtask2_11.txt |
WA |
9 ms |
22912 KB |