Luogu5020 货币系统 （完全背包）

bool型完全背包

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define R(a,b,c) for(register int  a = (b); a <= (c); ++ a)
#define nR(a,b,c) for(register int  a = (b); a >= (c); -- a)
#define Max(a,b) ((a) > (b) ? (a) : (b))
#define Min(a,b) ((a) < (b) ? (a) : (b))
#define Fill(a,b) memset(a, b, sizeof(a))
#define Abs(a) ((a) < 0 ? -(a) : (a))
#define Swap(a,b) a^=b^=a^=b
#define ll long long

#define ON_DEBUG

#ifdef ON_DEBUG

#define D_e_Line printf("\n\n----------\n\n")
#define D_e(x)  cout << #x << " = " << x << endl
#define Pause() system("pause")
#define FileOpen() freopen("in.txt","r",stdin);

#else

#define D_e_Line ;
#define D_e(x)  ;
#define Pause() ;
#define FileOpen() ;

#endif

struct ios{
    template<typename ATP>ios& operator >> (ATP &x){
        x = 0; int f = 1; char c;
        for(c = getchar(); c < '0' || c > '9'; c = getchar()) if(c == '-')  f = -1;
        while(c >= '0' && c <= '9') x = x * 10 + (c ^ '0'), c = getchar();
        x*= f;
        return *this;
    }
}io;
using namespace std;

const int N = 250007;

int f[N];
int a[N];
int main(){
//FileOpen();

	int Tasks;
	io >> Tasks;
	while(Tasks--){
		int n;
		io >> n;
		R(i,1,n){
			io >> a[i];
		}
		int ans = n;
		sort(a + 1, a + n + 1);
		Fill(f, 0);
		f[0] = 1;
		R(i,1,n){
			if(f[a[i]]){
				--ans;
				continue;
			}
			R(j,a[i],a[n]){
				f[j] |= f[j - a[i]];
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}