Submission #855548


Source Code Expand

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


using namespace std;

const int MAXN = 52;
const int MAXA = 50;

long long dp[MAXN][MAXN][(MAXA+1)*MAXN] = {0};
int x[MAXN] = {0};
int N,A;

void solve(){
	cin>>N>>A;
	for (int i=1;i<=N;i++){
		cin>>x[i];
	}
	for (int i=0;i<=N;i++)
		dp[i][0][0] = 1;
	for (int i=1;i<=N;i++){
		for (int k=1;k<=i;k++){
			for (int j=0;j<x[i];j++)
				dp[i][k][j] = dp[i-1][k][j];
			for (int j=x[i];j<=MAXA*i;j++){
				dp[i][k][j] = dp[i-1][k][j]+dp[i-1][k-1][j-x[i]];
			}
		}
	}
	long long rSum = 0;
	for (int k=1;k<=N;k++){
		rSum+=dp[N][k][A*k];
	}
	cout<<rSum<<endl;
//	cout<<dp[4][3][24]<<endl;
}


int main(){
//	freopen("in.txt","r",stdin);
	std::ios::sync_with_stdio(false);

//	int TestCase;
//	cin>>TestCase;
//	for (int i=0;i<TestCase;i++){
		solve();
//	}

	return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User zornlemma
Language C++14 (GCC 5.4.1)
Score 300
Code Size 842 Byte
Status AC
Exec Time 42 ms
Memory 21760 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 4 ms 384 KB
example_02.txt AC 4 ms 256 KB
example_03.txt AC 4 ms 512 KB
example_04.txt AC 18 ms 7552 KB
subtask1_01.txt AC 6 ms 1408 KB
subtask1_02.txt AC 6 ms 1408 KB
subtask1_03.txt AC 6 ms 1408 KB
subtask1_04.txt AC 6 ms 1408 KB
subtask1_05.txt AC 6 ms 1408 KB
subtask1_06.txt AC 4 ms 256 KB
subtask1_07.txt AC 4 ms 256 KB
subtask1_08.txt AC 6 ms 1408 KB
subtask1_09.txt AC 8 ms 1280 KB
subtask2_01.txt AC 42 ms 21760 KB
subtask2_02.txt AC 38 ms 21760 KB
subtask2_03.txt AC 37 ms 20736 KB
subtask2_04.txt AC 42 ms 21760 KB
subtask2_05.txt AC 42 ms 21760 KB
subtask2_06.txt AC 37 ms 21760 KB
subtask2_07.txt AC 41 ms 21760 KB
subtask2_08.txt AC 15 ms 7552 KB
subtask2_09.txt AC 17 ms 7552 KB
subtask2_10.txt AC 27 ms 13184 KB
subtask2_11.txt AC 30 ms 14848 KB