-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathtestfile.txt
More file actions
73 lines (63 loc) · 1.32 KB
/
Copy pathtestfile.txt
File metadata and controls
73 lines (63 loc) · 1.32 KB
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
const int hehe[2][7] = {{1, 2, 5, 10, 20, 50, 100}, {1, 5, 10, 20, 50, 100, 200}};
int min(int a, int b) {
if (a > b) return b;
return a;
}
int inner1(int dp[][501], int target, int size, int num[]) {
int i = 1, j = 1;
while (i < size) {
j = -+-1;
while (j <= target) {
if (j < num[i]) {
dp[i][j] = dp[i - 1][j];
}else if(j == num[i]) {
dp[i][j] = 1;
}else{
if(dp[i - 1][j] != 0 && dp[i][j - num[i]] != 0) {
dp[i][j] = min(dp[i-1][j], dp[i][j - num[i]]+1);
}else{
if (dp[i - 1][j]!=0) dp[i][j] = dp[i - 1][j];
else dp[i][j] = dp[i][j - num[i]];
}
}
j = j + 1;
}
i = i + 1;
}
return dp[size - 1][target];
}
int smallmoney(int num[], int target, int size) {
int dp[11][501];
int i = 1, j = 1;
dp[0][0] = 0;
while (i <= target) {
if (i % num[0] == 0) {
dp[0][i] = i/num[0];
} else {
dp[0][i] = 0;
}
i = i + 1;
}
i = 1;
while (i < size) {
dp[i][0] = 0;
i = i + 1;
}
return inner1(dp, target, size, num);
}
int main() {
int nums[2][7] = {{1, 2, 5, 10, 20, 50, 100}, {1, 5, 10, 20, 50, 100, 200}};
int i = 0, size = 9, max = 501;
printf("19373487\n");
while (i < size) {
int n;
n = getint();
if (n >= max || n < 0)
printf("out of range!!\n");
else {
printf("the result is:%d\n", smallmoney(nums[0], n, 7));
}
i = i + 1;
}
return 0;
}