fork download
  1. #include <iostream>
  2. #include<vector>
  3. #include<unordered_map>
  4. using namespace std;
  5.  
  6. int main() {
  7. // your code goes here
  8. vector<int> a={2,7,4,8,9,1,6};
  9. int k=9;
  10. int count=0;
  11. int sum=0;
  12. unordered_map<int,int> m;
  13. m[0]=1;
  14. for(int i=0;i<a.size();i++) {
  15. sum+=a[i];
  16. int ques=sum-k;
  17. if(m.find(ques)!=m.end()) {
  18. count+=m[ques];
  19. }
  20. m[sum]++;
  21. }
  22. cout<<count<<endl;
  23. return 0;
  24. }
  25.  
Success #stdin #stdout 0s 5320KB
stdin
Standard input is empty
stdout
2