Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    7 CoinChange

    Uploaded by

    Ajay Kumar

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd

    7 CoinChange

    Uploaded by

    Ajay Kumar
    12 views1 page

    Original Title

    7.CoinChange

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    12 views1 page

    7 CoinChange

    Uploaded by

    Ajay Kumar

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    of 1

    Problem Name: Coin Change

    Problem Difficulty: None


    Problem Constraints: 1<=N<=250
    1<=m<=50
    1 <= Si <= 50
    Problem Description:
    Given a value N, if we want to make change for N cents,
    and we have infinite supply of each of S = { S1, S2, .. , Sm} valued coins,
    In how many ways can we make the change? The order of coins doesn’t matter.

    Input Format: First line of input contain two space separated integers N and M.
    Second line of input contains M space separated integers - value of coins.
    Sample Input: 10 4
    2 5 3 6
    Output Format: Output a single integer denoting the number of ways to make the
    given change using given coin denominations.
    Sample Output: 5

    =====Solution=====

    #include <iostream>

    using namespace std;

    long long int dp[1005];


    long long int count( long long int S[], long long int m, long long int n )
    {
    dp[0] = 1;
    for(int i=0; i<m; i++)
    for(int j=S[i]; j<=n; j++)
    dp[j] += dp[j-S[i]];

    return dp[n];
    }

    int main()
    {
    long long int val[1005];
    //freopen("test.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int N,M;
    scanf("%d%d",&N,&M);
    for(int i=0; i<M ;++i)
    scanf("%lld",&val[i]);
    cout<<count(val,M,N);
    return 0;
    }

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy