GitHub - anindya444/coin-change.: Coin change count ways to make sum ,count all combination with infinite supply of coin.

anindya444 / coin-change. Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

Coin change count ways to make sum ,count all combination with infinite supply of coin.

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
.gitignore		.gitignore
README.cpp		README.cpp
photo_2025-05-14_08-24-06.jpg		photo_2025-05-14_08-24-06.jpg

Repository files navigation

# coin-change.
//Coin change count ways to make sum ,count all combination with infinite supply of coin.
#include <iostream>
#include <vector>
using namespace std;
int coinchange(vector<int>&coin,int n,int sum){
if(sum==0)
return 1;
if(n==0||sum<-1)
return 0;
return coinchange(coin,n,sum-coin[n-1])+coinchange(coin,n-1,sum);
}
int main()
{
  vector<int> coin = {1,2,3};
  int n=coin.size();
  int sum=10;
  cout<< coinchange(coin,n,sum);
  return 0;
}