Submission #2873522

---

Source Code Expand

#include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#include <type_traits>
#define int long long
#define ll long long
#define mod  1000000007
#define inf 1e17
#define rep(i,j,n) for(int i=j;i<n;i++)
double pi = 3.141592653589793;
using namespace std;
//ここから始めよう
int dp[55][55][2555]={};
signed main(){
    int n,a;cin>>n>>a;
    int maxi=-1;
    int x[55];rep(i,1,n+1){
        cin>>x[i]; maxi=max(maxi,x[i]);
    }//i枚目までを使い、合計でj枚使って、kを作れる洗濯指数
    rep(i,0,n+1){
        rep(j,0,i+1){
            rep(k,0,maxi*n+1){
                if(i==0&&k==0&&j==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;
    rep(i,1,n+1){
        ans+=dp[n][i][i*a];
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result