#include <iostream>
#include<vector>
#include<unordered_map>
using namespace std;
int main() {
// your code goes here
vector<int> a={2,7,4,8,9,1,6};
int k=9;
int count=0;
int sum=0;
unordered_map<int,int> m;
m[0]=1;
for(int i=0;i<a.size();i++) {
sum+=a[i];
int ques=sum-k;
if(m.find(ques)!=m.end()) {
count+=m[ques];
}
m[sum]++;
}
cout<<count<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTx2ZWN0b3I+CiNpbmNsdWRlPHVub3JkZXJlZF9tYXA+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCgl2ZWN0b3I8aW50PiBhPXsyLDcsNCw4LDksMSw2fTsKCWludCBrPTk7CglpbnQgY291bnQ9MDsKCWludCBzdW09MDsKCXVub3JkZXJlZF9tYXA8aW50LGludD4gbTsKCW1bMF09MTsKCWZvcihpbnQgaT0wO2k8YS5zaXplKCk7aSsrKSB7CgkJc3VtKz1hW2ldOwoJCWludCBxdWVzPXN1bS1rOwoJCWlmKG0uZmluZChxdWVzKSE9bS5lbmQoKSkgewoJCQljb3VudCs9bVtxdWVzXTsKCQl9CgkJbVtzdW1dKys7Cgl9Cgljb3V0PDxjb3VudDw8ZW5kbDsKCXJldHVybiAwOwp9Cg==