Submission #855693


Source Code Expand

Copy
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

#define dump(o) { cerr << #o << " " << o << endl; }
#define dumpc(o) { cerr << #o; for (auto &e : (o)) cerr << " " << e; cerr << endl; }
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL

const int MAX = 50 * 50 + 1;

signed main() {
	int N, A; cin >> N >> A;
	vector<int> x(N);
	ll dp[51][MAX] = {};
	dp[0][0] = 1;
	for (int i = 0; i < N; i++) {
		cin >> x[i];
		for (int j = N; j > 0; j--) {
			for (int k = MAX - 51; k >= 0; k--) {
				dp[j][k + x[i]] += dp[j - 1][k];
			}
		}
	}
	ll ans = 0;
	for (int i = 1; i <= N; i++) {
		//dumpc(dp[i]);
		ans += dp[i][i*A];
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User minaminao
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1154 Byte
Status AC
Exec Time 16 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 10 ms 1280 KB
subtask1_01.txt AC 7 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 16 ms 1280 KB
subtask2_02.txt AC 16 ms 1280 KB
subtask2_03.txt AC 15 ms 1280 KB
subtask2_04.txt AC 16 ms 1280 KB
subtask2_05.txt AC 16 ms 1280 KB
subtask2_06.txt AC 16 ms 1280 KB
subtask2_07.txt AC 16 ms 1280 KB
subtask2_08.txt AC 10 ms 1280 KB
subtask2_09.txt AC 10 ms 1280 KB
subtask2_10.txt AC 12 ms 1280 KB
subtask2_11.txt AC 13 ms 1280 KB