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
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>

using namespace std;

const int N_MAX = 5000;
const int P = 1000000000+7;
int R[N_MAX + 1];


int main() {
	int n;
	scanf("%d", &n);
	vector<int> v;
	for (int i = 0; i < n; ++i) {
		int a;
		scanf("%d", &a);
		v.push_back(a);
	}
	sort(v.begin(), v.end());
	int maks = v[n-1];
	R[0] = 1;
	for (int i = 0; i < n; ++i) {
		for (int k = maks; k >= v[i] - 1; --k) {
			R[min(v[i] + k, maks)] = (R[min(v[i] + k, maks)] + R[k]) % P;
		}
	}
	long long int r = 0;
	for (int i = 1; i <= maks; ++i) {
		r = (r + R[i]) % P;
	}
	printf("%lld\n", r);
	return 0;
}