-
Notifications
You must be signed in to change notification settings - Fork 77
/
change_dp.cpp
78 lines (73 loc) · 1.69 KB
/
change_dp.cpp
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
/*Author : Abdallah Hemdan */
/***********************************************/
/* Dear online judge:
* I've read the problem, and tried to solve it.
* Even if you don't accept my solution, you should respect my effort.
* I hope my code compiles and gets accepted.
* ___ __
* |\ \|\ \
* \ \ \_\ \
* \ \ ___ \emdan
* \ \ \\ \ \
* \ \__\\ \_\
* \|__| \|__|
*/
#include <iostream>
#include <cmath>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <iomanip>
#include <assert.h>
#include <vector>
#include <cstring>
#include <map>
#include <deque>
#include <queue>
#include <stack>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <set>
#include <complex>
#include <list>
#include <climits>
#include <cctype>
#include <bitset>
#include <numeric>
#include <array>
#include <tuple>
#include <stdexcept>
#include <utility>
#include <functional>
#include <locale>
#define all(v) v.begin(),v.end()
#define mp make_pair
#define pb push_back
#define endl '\n'
typedef long long int ll;
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
using namespace std;
int CountMinWays(int Coins[], int n, int Money) {
vector<int> Ways(Money + 1, INT_MAX);
Ways[0] = 0;
for (int i = 1; i <= Money; i++) {
for (int c = 0; c < n; c++) {
if (i >= Coins[c]) {
int sub_res = Ways[i - Coins[c]];
if (sub_res != INT_MAX && sub_res + 1 < Ways[i])
Ways[i] = sub_res + 1;
}
}
}
return Ways[Money];
}
int main() {
int Money;
cin >> Money;
int Coins[3] = { 1,3,4 };
cout << CountMinWays(Coins, 3, Money) << endl;
}