We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
The Coin Change Problem
The Coin Change Problem
Sort by
recency
|
723 Discussions
|
Please Login in order to post a comment
-c++ code
int rec(int n,vector&c) { int s=c.size(); vectorway(n+1,0); way[0]=1;
}
signed main() { // memset(dp, -1, sizeof(dp)); int n,m; cin >> n>>m; vectorv(m); for(int i=0;i>v[i]; int ans=rec(n,v); cout<
}
This is not much. But an honest work
PHP Recursion Solution Source: GeeksForGeeks!
This is my solution in Java language, based on the Internet.