#include <bits/stdc++.h>
using namespace std;
int counting(vector<int>&summ,int n,int k){
unordered_map<int,int>a;
int sum=0;
int count=0;
for(int i=0;i<n;i++){
sum+=summ[i];
if(sum==k){
count++;
}
int x=sum-k;
if(a.find(x)!=a.end()){
count+=a[x];
}
a[summ[i]]=i;
}
return count;
}
int main() {
// your code goes here
vector<int>summ={1,2,3,6,5};
int k=5;
int n=summ.size();
int ans=counting(summ,n,k);
cout<<ans;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBjb3VudGluZyh2ZWN0b3I8aW50PiZzdW1tLGludCBuLGludCBrKXsKCXVub3JkZXJlZF9tYXA8aW50LGludD5hOwoJaW50IHN1bT0wOwoJaW50IGNvdW50PTA7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQlzdW0rPXN1bW1baV07CgkJaWYoc3VtPT1rKXsKCQkJY291bnQrKzsKCQl9CgkJaW50IHg9c3VtLWs7CgkJaWYoYS5maW5kKHgpIT1hLmVuZCgpKXsKCQkJY291bnQrPWFbeF07CgkJfQoJCWFbc3VtbVtpXV09aTsKCX0KIAoJcmV0dXJuIGNvdW50Owp9CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCgl2ZWN0b3I8aW50PnN1bW09ezEsMiwzLDYsNX07CglpbnQgaz01OwoJaW50IG49c3VtbS5zaXplKCk7CglpbnQgYW5zPWNvdW50aW5nKHN1bW0sbixrKTsKCWNvdXQ8PGFuczsKCXJldHVybiAwOwp9