Submission #1990412

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<math.h>
#include<map>
#include<functional>
#include<queue>
using namespace std;
int main(){
    int n,a;
    cin>>n>>a;
    int x[60]={};
    int m=0;
    for(int i=0;i<n;i++){
        cin>>x[i];
        if(m>x[i]){
            m=x[i];
        }
    }
    int dp[51][51][2501]={};
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            for(int k=0;k<n*m;k++){
                if((i==0)&&(j==0)&&(k==0)){
                    dp[i][j][k]=1;
                }else if((i>=1)&&(k<x[i])){
                    dp[i][j][k]=dp[i-1][j][k];
                }else if((i>=1)&&(j>=1)&&(k<=x[i])){
                    dp[i][j][k]=dp[i-1][j][k]+dp[i-1][j-1][k-x[i]];
                    
                }else{
                    dp[i][j][k]=0;
                }
            }
        }
    }
    int ans=0;
    for(int i=1;i<=n;i++){
        ans+=dp[n][i][i*a];
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result