#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[]= {2,0,1,3,-1};
int n=sizeof(arr)/sizeof(arr[0]);
int count=0;
int currentSum=0;
unordered_map<int, int> mp;
mp[0]=1;
for(int j=0;j<n;j++){
currentSum = currentSum + arr[j];
int rhs = currentSum-(j+1);
if(mp.find(rhs)!=mp.end()){
count = count + mp[rhs];
}
mp[rhs]++;
}
cout<<count;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBhcnJbXT0gezIsMCwxLDMsLTF9OwoJaW50IG49c2l6ZW9mKGFycikvc2l6ZW9mKGFyclswXSk7CglpbnQgY291bnQ9MDsKCWludCBjdXJyZW50U3VtPTA7Cgl1bm9yZGVyZWRfbWFwPGludCwgaW50PiBtcDsKCW1wWzBdPTE7Cglmb3IoaW50IGo9MDtqPG47aisrKXsKCQljdXJyZW50U3VtID0gY3VycmVudFN1bSArIGFycltqXTsKCQlpbnQgcmhzID0gY3VycmVudFN1bS0oaisxKTsKCQlpZihtcC5maW5kKHJocykhPW1wLmVuZCgpKXsKCQkJY291bnQgPSBjb3VudCArIG1wW3Joc107CgkJfQoJCW1wW3Joc10rKzsKCX0KCWNvdXQ8PGNvdW50OwoJcmV0dXJuIDA7Cn0=