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

minimizing coins cases solution

Script Here answered on July 17, 2022 Popularity 4/10 Helpfulness 6/10

answer minimizing coins cases solution

minimizing coins cases solution

Comment

#include <bits/stdc++.h>
using namespace std;
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
 
   long long int c,n,x;
    cin>>n>>x;
    
    vector<long long int> coins;
    
    for(int i=0;i<n;i++)
    {
        cin>>c;
        coins.push_back(c);
    }
    
    vector<long long int> dp(x+1,0);
    
    for(long long int i=1;i<=x;i++)
    {
        dp[i]=INT_MAX;
        for(long long int j=0;j<n;j++)
        {
            if(i-coins[j] >= 0)
            dp[i] = min(dp[i],dp[i-coins[j]]+1);
        }
    }
    
    cout << (dp[x] >= INT_MAX ? -1 : dp[x]) << endl;
    
}

Popularity 4/10 Helpfulness 6/10 Language whatever

Source: Grepper

Tags: solution whatever

Link to this answer
Share Copy Link

Contributed on Jul 17 2022

Script Here

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.

minimizing coins cases solution

Contents

More Related Answers

minimizing coins cases solution

Grepper

Documentation

Social

Legal

Contact

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