Breaking News: Grepper is joining You.com. Read the official announcement!

Coin Combination 2

Anshuman Sharma answered on April 28, 2022 Popularity 8/10 Helpfulness 2/10

answer Coin Combination 2

Coin Combination 2

Comment

#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define loop(i,a,n) for(int i=a;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define all1(v) (v).begin()+1,(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define allr1(v) (v).rbegin()+1,(v).rend()
#define ff first
#define ss second
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
using namespace std;
void solve(){ 
     ll n,k;
     cin>>n>>k;
     vector<ll>arr(n);
     loop(i,0,n)cin>>arr[i];
     vector<ll>dp(k+1,0);
     dp[0]=1;
     for (int i = 1; i <=n; i++)
     {
         for (int j = 0; j <=k; j++)
         {
             if(j-arr[i-1]>=0)
                (dp[j]+=dp[j-arr[i-1]]) %=INF;
         }
         
     }
     cout<<dp[k];
     
}
int main() {
int t=1;
 
while(t--){
 solve(); 
}
     return 0;
}

Popularity 8/10 Helpfulness 2/10 Language whatever

Source: cses.fi

Tags: whatever

Link to this answer
Share Copy Link

Contributed on Apr 28 2022

Anshuman Sharma

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Coin Combination 2

Contents

More Related Answers

Coin Combination 2

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.