有n种问题,面值分别为V1,V2,······,Vn,每种都有无限多。给定非负整数S,可以选用多少个硬币,使得面值之和恰好为S?输出硬币数目的最小值和最大值。1≤n≤100,0≤S≤10000,1≤Vi≤S;
样例输入:
3 16
1 2 3
样例输出:
16 6
#include<iostream>
#include<vector>
using namespace std;
int main()
{
vector<int>coin;
vector<int>Max;
vector<int>Min;
int n, S;
cin >> n >> S;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
coin.push_back(temp);
}
Max.resize(S+1, 0);
Min.resize(S+1, 10000);
Min[0] = 0;
for (int i = 1; i <= S; i++) {
for (int j = 0; j < n; j++) {
if (i >= coin[j]) {
Max[i] = max(Max[i - coin[j]] + 1, Max[i]);
Min[i] = min(Min[i - coin[j]] + 1, Min[i]);
}
}
}
cout << Max[S] << " " << Min[S];
return 0;
}