FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
cpp/algorithms/dynamic-programming/coin_change.cpp at master · AllAlgorithms/cpp · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
This repository was archived by the owner on Sep 7, 2025. It is now read-only.
AllAlgorithms
/
cpp
Public archive
Notifications
You must be signed in to change notification settings
Fork
339
Star
841
Code
Issues
9
Pull requests
33
Actions
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Security and quality
Insights
Expand file tree
Breadcrumbs
cpp
/
algorithms
/
dynamic-programming
/
coin_change.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
53 lines (47 loc) · 1.22 KB
Breadcrumbs
cpp
/
algorithms
/
dynamic-programming
/
coin_change.cpp
Copy path
File metadata and controls
53 lines (47 loc) · 1.22 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
//
//
A Stack is an abstract data type that serves as a collection
//
of elements, with two principal operations are push & pop
//
//
The All ▲lgorithms library for python
//
//
https://allalgorithms.com/dynamic-programming/
//
https://github.com/allalgorithms/cpp
//
//
Contributed by: Nikunj Taneja
//
Github: @underscoreorcus
//
#
include
<
iostream
>
using
namespace
std
;
int
count
(
int
S[],
int
m,
int
n )
{
int
i, j, x, y;
//
We need n+1 rows as the table is constructed
//
in bottom up manner using the base case 0
//
value case (n = 0)
int
table[n+
1
][m];
//
Fill the enteries for 0 value case (n = 0)
for
(i=
0
; i<m; i++)
table[
0
][i] =
1
;
//
Fill rest of the table entries in bottom
//
up manner
for
(i =
1
; i < n+
1
; i++)
{
for
(j =
0
; j < m; j++)
{
//
Count of solutions including S[j]
x = (i-S[j] >=
0
)? table[i - S[j]][j]:
0
;
//
Count of solutions excluding S[j]
y = (j >=
1
)? table[i][j-
1
]:
0
;
table[i][j] = x + y;
}
}
return
table[n][m-
1
];
}
int
main
()
{
int
coins[] = {
1
,
2
,
3
};
int
m =
sizeof
(coins)/
sizeof
(
int
);
int
n =
5
;
cout <<
count
(coins, m, n);
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL