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