Submission #855559


Source Code Expand

Copy
#include <bits/stdc++.h>

using namespace std;

void solve();

int main() {
#ifdef OFFLINE
	freopen("input.txt", "r", stdin);
#endif
	ios::sync_with_stdio(false);
	solve();
	return 0;
}

#define forn(i, n) for (int i=0; i<n; i++)

typedef long long llong;

const int N = 51;

int n, x;
int a[N];

llong d[N*N][N];

void solve() {
	cin >> n >> x;
	forn(i, n)
		cin >> a[i];
	
	d[0][0] = 1;
	forn(i, n) {
		for (int j=N*N-1-a[i]; j >= 0; j--)
			for (int k=0; k<n; k++)
				if (d[j][k])
					d[j+a[i]][k+1] += d[j][k];
	}

	llong res = 0;
	for (int k=1; k <= n; k++)
		res += d[k*x][k];

	cout << res << endl;
}

Submission Info

Submission Time
Task C - Tak and Cards
User bulat_s
Language C++14 (GCC 5.4.1)
Score 300
Code Size 653 Byte
Status AC
Exec Time 17 ms
Memory 768 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 4
AC × 12
AC × 24
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 5 ms 256 KB
example_02.txt AC 5 ms 256 KB
example_03.txt AC 5 ms 256 KB
example_04.txt AC 10 ms 256 KB
subtask1_01.txt AC 6 ms 512 KB
subtask1_02.txt AC 6 ms 384 KB
subtask1_03.txt AC 6 ms 384 KB
subtask1_04.txt AC 6 ms 256 KB
subtask1_05.txt AC 6 ms 384 KB
subtask1_06.txt AC 4 ms 256 KB
subtask1_07.txt AC 4 ms 256 KB
subtask1_08.txt AC 6 ms 512 KB
subtask1_09.txt AC 6 ms 384 KB
subtask2_01.txt AC 17 ms 768 KB
subtask2_02.txt AC 17 ms 768 KB
subtask2_03.txt AC 17 ms 768 KB
subtask2_04.txt AC 16 ms 512 KB
subtask2_05.txt AC 16 ms 512 KB
subtask2_06.txt AC 16 ms 256 KB
subtask2_07.txt AC 17 ms 640 KB
subtask2_08.txt AC 11 ms 512 KB
subtask2_09.txt AC 11 ms 640 KB
subtask2_10.txt AC 14 ms 768 KB
subtask2_11.txt AC 15 ms 640 KB