Submission #854891


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 55;
long long int dp[MAXN][MAXN*MAXN][MAXN], x[MAXN];
int main()
{
	int n,a;
	cin>>n>>a;
	for (int i = 1; i <= n; ++i)
	{
		cin>>x[i];
	}
	dp[0][0][0] = 1;
	int cmax = 0;
	for (int i = 1; i <= n; ++i)
	{
		cmax+=x[i];
		for (int j = 0; j <= cmax; ++j)
		{
			for (int k = 0; k <= n; ++k)
			{
				dp[i][j][k] = dp[i-1][j][k];
				if(j >= x[i])
					dp[i][j][k]+=dp[i-1][j-x[i]][k-1];
			}
		}
	}
	long long int ans = 0;
	for (int i = 1; i <= n; ++i)
	{
		ans+=dp[n][a*i][i];
	}
	cout<<ans<<"\n";
	return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User akulsareen
Language C++14 (GCC 5.4.1)
Score 300
Code Size 605 Byte
Status AC
Exec Time 54 ms
Memory 27904 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 256 KB
example_02.txt AC 4 ms 256 KB
example_03.txt AC 4 ms 384 KB
example_04.txt AC 6 ms 1152 KB
subtask1_01.txt AC 9 ms 2816 KB
subtask1_02.txt AC 9 ms 3200 KB
subtask1_03.txt AC 8 ms 3200 KB
subtask1_04.txt AC 4 ms 384 KB
subtask1_05.txt AC 7 ms 1792 KB
subtask1_06.txt AC 5 ms 256 KB
subtask1_07.txt AC 4 ms 256 KB
subtask1_08.txt AC 8 ms 2048 KB
subtask1_09.txt AC 6 ms 1664 KB
subtask2_01.txt AC 30 ms 14464 KB
subtask2_02.txt AC 26 ms 13696 KB
subtask2_03.txt AC 26 ms 13952 KB
subtask2_04.txt AC 54 ms 27904 KB
subtask2_05.txt AC 48 ms 27904 KB
subtask2_06.txt AC 6 ms 1024 KB
subtask2_07.txt AC 29 ms 13952 KB
subtask2_08.txt AC 14 ms 5632 KB
subtask2_09.txt AC 15 ms 7424 KB
subtask2_10.txt AC 24 ms 11008 KB
subtask2_11.txt AC 19 ms 9728 KB