NC21228 货币系统

题目地址：

https://ac.nowcoder.com/acm/problem/21228

基本思路：

参考代码：

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define IO std::ios::sync_with_stdio(false)
#define int long long
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define per(i, l, r) for (int i = l; i >= r; i--)
#define mset(s, _) memset(s, _, sizeof(s))
#define pb push_back
#define pii pair <int, int>
#define mp(a, b) make_pair(a, b)
#define INF (int)1e18

inline int read() {
  int x = 0, neg = 1; char op = getchar();
  while (!isdigit(op)) { if (op == '-') neg = -1; op = getchar(); }
  while (isdigit(op)) { x = 10 * x + op - '0'; op = getchar(); }
  return neg * x;
}
inline void print(int x) {
  if (x < 0) { putchar('-'); x = -x; }
  if (x >= 10) print(x / 10);
  putchar(x % 10 + '0');
}

const int maxn = 110;
int n,a[maxn];
bool dp[25010];
signed main() {
  IO;
  int t;
  cin >> t;
  while (t--) {
    cin >> n;
    rep(i, 1, n) cin >> a[i];
    sort(a + 1, a + 1 + n);//排序;
    mset(dp, false);
    dp[0] = true;
    int ans = 0;
    rep(i, 1, n) {
      if (!dp[a[i]]) {//是必需的;
        ans++;
        for (int j = a[i]; j <= 25010; j++) dp[j] |= dp[j - a[i]];//更新完全背包;
      }
    }
    cout << ans << '\n';
  }
  return 0;
}