Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- int t,cas,i,j,k,n,banaitehbe;
- cin>>t;
- for(cas=1;cas<=t;cas++)
- {
- cin>>n>>banaitehbe;
- int value[n+5],dp[banaitehbe+5];
- for(i=0;i<n;i++)
- {
- cin>>value[i];
- }
- memset(dp,0,sizeof(dp));
- dp[0]=1;
- for(i=0;i<n;i++)
- {
- for(j=value[i];j<=banaitehbe;j++)
- {
- dp[j]=(dp[j]+dp[j-value[i]])%100000007;
- }
- }
- cout<<"Case "<<cas<<": "<<dp[banaitehbe]<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement