fork download
copy 
  1. #include <iostream>
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4.  
  5. int main() {
  6. 	// your code goes here
  7. 	vector<int>nums={1,1,1,-1,1,2,3,4,5};
  8. 	int k=3;
  9.  
  10. 	unordered_map<int,int>mpp;
  11.         mpp[0]=1;
  12.         int sum=0;
  13.         int ans=0;
  14.         for(int i=0;i<nums.size();i++){
  15.             sum+=nums[i];
  16.             if(mpp.find(sum-k)!=mpp.end())ans+=mpp[sum-k];
  17.             mpp[sum]++;
  18.         }
  19. 	cout<<ans;
  20. 	return 0;
  21. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
5
https://ideone.com/76jL6a
count subarray sum=k(optimal)
language:
C++ (gcc 8.3)
created:
7 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!