Cod sursa(job #3223203)
Utilizator | Data | 12 aprilie 2024 17:47:28 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
long long n,dp[1000005],h[1000005],s;
const int MOD=1e9+7;
int main()
{
cin>>n>>s;
for(int i=1;i<=n;i++)
{
cin>>h[i];
dp[h[i]]=1;
}
for(int i=1;i<=s;i++)
{
for(int j=1;j<=n;j++)
{
if(i-h[j]>0)
{
dp[i]=(dp[i]+dp[i-h[j]])%MOD;
}
}
}
cout<<dp[s];
return 0;
}