Submission #855813


Source Code Expand

Copy
#include <iostream>
using namespace std;

typedef unsigned long long ull;

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N, A;
	int x[50];
	ull dp[2501][51];
	cin >> N >> A;
	for(int i=0; i<N; i++) cin >> x[i];

	for(int i=0; i<=2500; i++){
		for(int j=0; j<=50; j++) dp[i][j] = 0;
	}
	dp[0][0] = 1;

	for(int i=0; i<N; i++){
		for(int k=50; k>0; k--){
			for(int j=x[i]; j<=2500; j++){
				dp[j][k] += dp[j-x[i]][k-1];
			}
		}
	}

	ull res = 0;
	for(int k=1; k<=50; k++){
		for(int j=1; j<=2500; j++){
			if(j == A * k) res += dp[j][k];
		}
	}

	cout << res << endl;

	return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User suzume
Language C++14 (GCC 5.4.1)
Score 300
Code Size 637 Byte
Status AC
Exec Time 34 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 7 ms 1280 KB
example_02.txt AC 7 ms 1280 KB
example_03.txt AC 10 ms 1280 KB
example_04.txt AC 22 ms 1280 KB
subtask1_01.txt AC 13 ms 1280 KB
subtask1_02.txt AC 13 ms 1280 KB
subtask1_03.txt AC 14 ms 1280 KB
subtask1_04.txt AC 14 ms 1280 KB
subtask1_05.txt AC 14 ms 1280 KB
subtask1_06.txt AC 6 ms 1280 KB
subtask1_07.txt AC 6 ms 1280 KB
subtask1_08.txt AC 16 ms 1280 KB
subtask1_09.txt AC 13 ms 1280 KB
subtask2_01.txt AC 31 ms 1280 KB
subtask2_02.txt AC 31 ms 1280 KB
subtask2_03.txt AC 34 ms 1280 KB
subtask2_04.txt AC 30 ms 1280 KB
subtask2_05.txt AC 32 ms 1280 KB
subtask2_06.txt AC 32 ms 1280 KB
subtask2_07.txt AC 31 ms 1280 KB
subtask2_08.txt AC 23 ms 1280 KB
subtask2_09.txt AC 23 ms 1280 KB
subtask2_10.txt AC 26 ms 1280 KB
subtask2_11.txt AC 27 ms 1280 KB