#include<cstdio> #include<iostream> #include<queue> using namespace std; int n, a, suma, wynik; int count[5005]; priority_queue<int> Q; int mod = 1000000007, maxx = 5000; int main() { ios_base::sync_with_stdio(0); cin >> n; for(int i = 1; i <= n; i++) { cin >> a; Q.push(-a); } if(Q.top() != -1) { cout << 0 << endl; return 0; } count[0] = 1; while(!Q.empty()) { a = -Q.top(); Q.pop(); for (int i = maxx; i >= a-1; i--) { if(i+a >= maxx) { count[maxx] = (count[maxx] + count[i]) % mod; } else { count[i+a] = (count[i+a] + count[i]) % mod; } } suma += a; } for(int i = 1; i <= maxx; i++) { wynik = (wynik + count[i]) % mod; } cout << wynik; return 0; }
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 | #include<cstdio> #include<iostream> #include<queue> using namespace std; int n, a, suma, wynik; int count[5005]; priority_queue<int> Q; int mod = 1000000007, maxx = 5000; int main() { ios_base::sync_with_stdio(0); cin >> n; for(int i = 1; i <= n; i++) { cin >> a; Q.push(-a); } if(Q.top() != -1) { cout << 0 << endl; return 0; } count[0] = 1; while(!Q.empty()) { a = -Q.top(); Q.pop(); for (int i = maxx; i >= a-1; i--) { if(i+a >= maxx) { count[maxx] = (count[maxx] + count[i]) % mod; } else { count[i+a] = (count[i+a] + count[i]) % mod; } } suma += a; } for(int i = 1; i <= maxx; i++) { wynik = (wynik + count[i]) % mod; } cout << wynik; return 0; } |