rt，只有第四行有区别

#include <cstdio>
#include <algorithm> 
#define maxn 100
#define maxx 25000

int n, maxl, a[maxn + 10], could[maxx + 10] = {1}, can[maxx + 10] = {1}, ans;
int main(void) {
	//freopen("in.in", "r", stdin);
	int T; scanf("%d", &T);
	while (T--) {
		scanf("%d", &n);
		ans = 0;
		for (int i = 1; i <= n; i++) {
			scanf("%d", a + i);
			if (a[i] > maxl) maxl = a[i];
		}
		for (int i = 1; i <= maxl; i++)
			could[i] = can[i] = 0;
		std :: sort(a + 1, a + n + 1);
		for (int i = 1; i <= maxl; i++)
			for (int j = 1; j <= n; j++)
				if (i - a[j] >= 0 && could[i - a[j]]) could[i] = 1;
		for (int i = 1; i <= maxl; i++) 
			if (could[i] && !can[i]) {
				ans++;
				for (int j = i; j <= maxl; j++)
					if (can[j - i]) can[j] = 1;
			}
		printf("%d\n", ans);
	}
	return 0;
} 

#include <cstdio>
#include <algorithm> 
#define maxn 100
#define maxx 2500000

int n, maxl, a[maxn + 10], could[maxx + 10] = {1}, can[maxx + 10] = {1}, ans;
int main(void) {
	//freopen("in.in", "r", stdin);
	int T; scanf("%d", &T);
	while (T--) {
		scanf("%d", &n);
		ans = 0;
		for (int i = 1; i <= n; i++) {
			scanf("%d", a + i);
			if (a[i] > maxl) maxl = a[i];
		}
		for (int i = 1; i <= maxl; i++)
			could[i] = can[i] = 0;
		std :: sort(a + 1, a + n + 1);
		for (int i = 1; i <= maxl; i++)
			for (int j = 1; j <= n; j++)
				if (i - a[j] >= 0 && could[i - a[j]]) could[i] = 1;
		for (int i = 1; i <= maxl; i++) 
			if (could[i] && !can[i]) {
				ans++;
				for (int j = i; j <= maxl; j++)
					if (can[j - i]) can[j] = 1;
			}
		printf("%d\n", ans);
	}
	return 0;
} 

2500000应该不会炸吧