MOD=10**9+7
ans=0
fact=[1]
for i in range(1,4*10**5+5):
fact.append(fact[-1]*i%MOD)
def c(m,n):
return fact[m]*pow(fact[m-n]*fact[n],-1,MOD)
n=int(input())
for i,a in enumerate(map(int,input().split())):
if a>0:
ans+=c(a+i,i+1)%MOD
ans%=MOD
print(ans)#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(x) ((int) x.size())
#define all(x) x.begin(), x.end()
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
const int M = 1e9 + 7;
const int maxn = 5e5 + 1;
ll fexp(ll a, ll b) {
if (b == 0) return 1;
ll f = fexp(a, b / 2);
f = (f * f) % M;
if (b % 2) f = (f * a) % M;
return f;
}
ll inv(ll n) {
return fexp(n, M - 2);
}
ll fat[maxn];
ll chs(ll n, ll k) {
return (fat[n] * inv((fat[n - k] * fat[k]) % M)) % M;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
fat[0] = 1;
for (int i = 1; i < maxn; ++i) {
fat[i] = (fat[i - 1] * i) % M;
}
int n; cin >> n; ++n;
vi a(n);
for (int &x : a) cin >> x;
ll ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] == 0) break;
ans = (ans + chs(i + a[i], a[i] - 1)) % M;
}
cout << ans << '\n';
return 0;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |