Submission #855722


Source Code Expand

Copy
#include <algorithm>
#include <cstdio>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <cassert>
#include <cfloat>
#include <climits>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define int long long
using namespace std;
int dp[51][2501];
signed main() {
	int N, A;
	cin >> N >> A;
	vector <int>x(N);
	int res = 0;
	for (int i = 0; i < N; i++) {
		cin >> x[i];
	}
	for (int i = 0; i < 51; i++) {
		for (int j = 0; j < 2501; j++) {
			dp[i][j] = 0;
		}
	}
	dp[0][0] = 1;
	for (int k = 0; k < N; k++) {
		for (int i = N; i > 0; i--) {
			for (int j = 2500; j >=x[k]; j--) {
				
					dp[i][j] += dp[i - 1][j - x[k]];
				
			}
		}
	}
	for (int i = 1; i < N+1; i++) {
		res += dp[i][i*A];
	}
	cout << res << endl;
	return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User ats5515
Language C++14 (GCC 5.4.1)
Score 300
Code Size 963 Byte
Status AC
Exec Time 15 ms
Memory 1280 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 1280 KB
example_02.txt AC 5 ms 1280 KB
example_03.txt AC 5 ms 1280 KB
example_04.txt AC 9 ms 1280 KB
subtask1_01.txt AC 6 ms 1280 KB
subtask1_02.txt AC 6 ms 1280 KB
subtask1_03.txt AC 6 ms 1280 KB
subtask1_04.txt AC 6 ms 1280 KB
subtask1_05.txt AC 6 ms 1280 KB
subtask1_06.txt AC 5 ms 1280 KB
subtask1_07.txt AC 5 ms 1280 KB
subtask1_08.txt AC 6 ms 1280 KB
subtask1_09.txt AC 6 ms 1280 KB
subtask2_01.txt AC 14 ms 1280 KB
subtask2_02.txt AC 14 ms 1280 KB
subtask2_03.txt AC 14 ms 1280 KB
subtask2_04.txt AC 15 ms 1280 KB
subtask2_05.txt AC 15 ms 1280 KB
subtask2_06.txt AC 15 ms 1280 KB
subtask2_07.txt AC 15 ms 1280 KB
subtask2_08.txt AC 9 ms 1280 KB
subtask2_09.txt AC 9 ms 1280 KB
subtask2_10.txt AC 12 ms 1280 KB
subtask2_11.txt AC 12 ms 1280 KB