#include <iostream>
#include<vector>
#include<unordered_map>
using namespace std;
int main() {
vector<int> nums={10,2,-2,-20,10};
int k=-10;
int sum=0;
unordered_map<int,int> m;
int count=0;
m[0]=1;
for(int i=0;i<nums.size();i++) {
sum+=nums[i];
int ques=sum-k;
if(m.find(ques)!=m.end()) {
count+=m[ques];
}
m[sum]++;
}
cout<<count<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTx2ZWN0b3I+CiNpbmNsdWRlPHVub3JkZXJlZF9tYXA+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCXZlY3RvcjxpbnQ+IG51bXM9ezEwLDIsLTIsLTIwLDEwfTsKCWludCBrPS0xMDsKCWludCBzdW09MDsKCXVub3JkZXJlZF9tYXA8aW50LGludD4gbTsKCWludCBjb3VudD0wOwoJbVswXT0xOwoJCglmb3IoaW50IGk9MDtpPG51bXMuc2l6ZSgpO2krKykgewoJCXN1bSs9bnVtc1tpXTsKCQlpbnQgcXVlcz1zdW0tazsKCQkKCQlpZihtLmZpbmQocXVlcykhPW0uZW5kKCkpIHsKCQkJY291bnQrPW1bcXVlc107CgkJfQoJCQoJCW1bc3VtXSsrOwoJfQoJY291dDw8Y291bnQ8PGVuZGw7CglyZXR1cm4gMDsKfQ==