Submission #856192


Source Code Expand

Copy
#include<iostream>

using namespace std;

typedef long long ll;

ll data[103];
ll C[51][51];
ll dp[51][2501];
ll pow(ll a,ll b){
	ll re=1;
	for(int i=0;i<b;i++){
		re*=a;
	}
	return re;
}
int main(){
	C[0][0]=1;
	for(int i=1;i<51;i++){
		for(int j=0;j<51;j++){
			C[i][j]=C[i-1][j];
			if(j)C[i][j]+=C[i-1][j-1];
		}
	}
	int N,A;
	cin>>N>>A;
	dp[0][0]=1;
	for(int i=0;i<N;i++){
		int x;
		cin>>x;
		data[x]++;
		for(int j=2501-x;j>=0;j--){
			for(int k=50;k>=1;k--){
				dp[k][j+x]+=dp[k-1][j];
			}
		}
	}
	ll ans=0;
	for(int i=1;i<2501;i++){
		for(int j=1;j<51;j++){
			if(i==A*j){
				ans+=dp[j][i];
			}
		}
	}
	cout<<ans<<endl;
}

Submission Info

Submission Time
Task C - Tak and Cards
User ryogo108
Language C++14 (GCC 5.4.1)
Score 300
Code Size 682 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 8 ms 1280 KB
example_02.txt AC 7 ms 1280 KB
example_03.txt AC 8 ms 1280 KB
example_04.txt AC 13 ms 1280 KB
subtask1_01.txt AC 9 ms 1280 KB
subtask1_02.txt AC 10 ms 1280 KB
subtask1_03.txt AC 10 ms 1280 KB
subtask1_04.txt AC 10 ms 1280 KB
subtask1_05.txt AC 9 ms 1280 KB
subtask1_06.txt AC 7 ms 1280 KB
subtask1_07.txt AC 7 ms 1280 KB
subtask1_08.txt AC 9 ms 1280 KB
subtask1_09.txt AC 9 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 12 ms 1280 KB
subtask2_09.txt AC 12 ms 1280 KB
subtask2_10.txt AC 14 ms 1280 KB
subtask2_11.txt AC 14 ms 1280 KB