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
#include <iostream>
#include <algorithm>
using namespace std;

int cuk[5007];
long long ile[25000007];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin>>n;
	
	for (int i = 0; i < n; i++) {
		cin>>cuk[i];
	}
	
	sort(cuk, cuk + n);
	int ost = 0;
	ile[0] = 1;
	
	for (int i = 0; i < n; i++) {
		
		if (cuk[i] > ost + 1) {
			break;
		}
		
		for (int j = ost; j >= 0 && cuk[i] <= j + 1; j--) {
			
			ile[j + cuk[i]] += ile[j];
			if (ile[j + cuk[i]] >= 1000000007) {
				ile[j + cuk[i]] -= 1000000007;
			}
		}
		
		ost += cuk[i];
	}
	
	long long suma = 0;
	for (int i = 1; i <= ost; i++) {
		suma += ile[i];
		if (suma >= 1000000007) {
			suma -= 1000000007;
		}
	}
	
	cout<<suma<<"\n";
}