Skip to content

Create CoinChange.cpp #30

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
samyakjain26 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Create CoinChange.cpp #30

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
48 changes: 48 additions & 0 deletions CoinChange.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,48 @@
// C++ program for coin change problem

#include <bits/stdc++.h>

using namespace std;

int count(int coins[], int n, int sum)
{
int i, j, x, y;

// We need sum+1 rows as the table
// is constructed in bottom up
// manner using the base case 0
// value case (sum = 0)
int table[sum + 1][n];

// Fill the entries for 0
// value case (sum = 0)
for (i = 0; i < n; i++)
table[0][i] = 1;

// Fill rest of the table entries
// in bottom up manner
for (i = 1; i < sum + 1; i++) {
for (j = 0; j < n; j++) {
// Count of solutions including coins[j]
x = (i - coins[j] >= 0) ? table[i - coins[j]][j]
: 0;

// Count of solutions excluding coins[j]
y = (j >= 1) ? table[i][j - 1] : 0;

// total count
table[i][j] = x + y;
}
}
return table[sum][n - 1];
}

// Driver Code
int main()
{
int coins[] = { 1, 2, 3 };
int n = sizeof(coins) / sizeof(coins[0]);
int sum = 4;
cout << count(coins, n, sum);
return 0;
}