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

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBjb3VudGluZyhpbnQgYXJyW10saW50IG4saW50IGspewoJdW5vcmRlcmVkX21hcDxpbnQsaW50PmE7CglpbnQgc3VtPTA7CglpbnQgY291bnQ9MDsKCWZvcihpbnQgaT0wO2k8bjtpKyspewoJCXN1bSs9YXJyW2ldOwoJCWlmKHN1bT09ayl7CgkJCWNvdW50Kys7CgkJfQoJCWludCB4PXN1bS1rOwoJCWlmKGEuZmluZCh4KSE9YS5lbmQoKSl7CgkJCWNvdW50Kz1hW3hdOwoJCX0KCQlhW2FycltpXV09aTsKCX0KIAoJcmV0dXJuIGNvdW50Owp9CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgYXJyW109ezEsMiwzLDYsNX07CglpbnQgaz01OwoJaW50IG49c2l6ZW9mKGFycikvc2l6ZW9mKGFyclswXSk7CglpbnQgYW5zPWNvdW50aW5nKGFycixuLGspOwoJY291dDw8YW5zOwoJcmV0dXJuIDA7Cn0=