#define _USE_MATH_DEFINES #include <bits/stdc++.h> #ifdef LOC #include "debuglib.h" #else #define deb(...) #define DBP(...) #endif using namespace std; using ll = long long; using Vi = vector<int>; using Pii = pair<int, int>; #define pb push_back #define mp make_pair #define x first #define y second #define rep(i, b, e) for (int i = (b); i < (e); i++) #define each(a, x) for (auto& a : (x)) #define all(x) (x).begin(), (x).end() #define sz(x) int((x).size()) constexpr int MOD = 1e9+7; int main() { cin.sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(10); int n; cin >> n; Vi a(n); each(k, a) cin >> k; sort(all(a)); vector<ll> dp(5005); dp[0] = 1; each(k, a) { for (int s = sz(dp)-1; s >= k-1; s--) { auto& out = dp[min(s+k, sz(dp)-1)]; out += dp[s]; if (out >= MOD) out -= MOD; } } ll ans = accumulate(all(dp), 0ll) - 1; ans %= MOD; if (ans < 0) ans += MOD; cout << ans << '\n'; 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 47 48 49 | #define _USE_MATH_DEFINES #include <bits/stdc++.h> #ifdef LOC #include "debuglib.h" #else #define deb(...) #define DBP(...) #endif using namespace std; using ll = long long; using Vi = vector<int>; using Pii = pair<int, int>; #define pb push_back #define mp make_pair #define x first #define y second #define rep(i, b, e) for (int i = (b); i < (e); i++) #define each(a, x) for (auto& a : (x)) #define all(x) (x).begin(), (x).end() #define sz(x) int((x).size()) constexpr int MOD = 1e9+7; int main() { cin.sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(10); int n; cin >> n; Vi a(n); each(k, a) cin >> k; sort(all(a)); vector<ll> dp(5005); dp[0] = 1; each(k, a) { for (int s = sz(dp)-1; s >= k-1; s--) { auto& out = dp[min(s+k, sz(dp)-1)]; out += dp[s]; if (out >= MOD) out -= MOD; } } ll ans = accumulate(all(dp), 0ll) - 1; ans %= MOD; if (ans < 0) ans += MOD; cout << ans << '\n'; return 0; } |