fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. inline int power(int a, int b) {
  6. int x = 1;
  7. while (b) {
  8. if (b & 1) x *= a;
  9. a *= a;
  10. b >>= 1;
  11. }
  12. return x;
  13. }
  14.  
  15.  
  16. const int M = 1000000007;
  17. const int N = 3e5+9;
  18. const int INF = 2e9+1;
  19. const int LINF = 2000000000000000001;
  20.  
  21. //_ ***************************** START Below *******************************
  22.  
  23.  
  24.  
  25. vector<int> a;
  26. void consistency(int n, int k) {
  27.  
  28. int sum = 0;
  29. int ans = 0;
  30. unordered_map<int,int> mp = {{0, 1}};
  31. for(int i=0; i<n; i++){
  32. sum += a[i];
  33. if(mp.count(sum-k)){
  34. ans += mp[sum-k];
  35. }
  36. mp[sum]++;
  37. }
  38. cout << ans << endl;
  39. }
  40.  
  41. void solve() {
  42.  
  43. int n, k;
  44. cin >> n >> k;
  45. a.resize(n);
  46. for(int i=0; i<n; i++) cin >> a[i];
  47.  
  48. consistency(n, k) ;
  49.  
  50. }
  51.  
  52.  
  53.  
  54.  
  55.  
  56. int32_t main() {
  57. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  58.  
  59. int t = 1;
  60. while (t--) {
  61. solve();
  62. }
  63.  
  64. return 0;
  65. }
Success #stdin #stdout 0s 5324KB
stdin
5 5
1 2 3 4 5
stdout
2