fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25.  
  26. //_ ***************************** START Below *******************************
  27.  
  28.  
  29. // 2
  30. // 5
  31. // 1 5 3 4 -2
  32. // 9
  33. // 1 5 -2 2 3 -1 1 0 4
  34.  
  35.  
  36.  
  37.  
  38. vector<int> a;
  39.  
  40. int consistency(int n) {
  41.  
  42. unordered_map<int,int> mp = {{1, 1}};
  43. int sum = 0;
  44. int ans = 0;
  45.  
  46. for(int i=0; i<n; i++){
  47. sum += a[i];
  48.  
  49. if(mp.count(sum-i)){
  50. ans += mp[sum-i];
  51. }
  52. mp[sum-i]++;
  53. }
  54.  
  55.  
  56. return ans;
  57.  
  58. }
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70. int practice(int n){
  71.  
  72.  
  73. return 0;
  74. }
  75.  
  76.  
  77.  
  78. void solve() {
  79.  
  80. int n;
  81. cin>> n;
  82.  
  83. a.resize(n);
  84. for(int i=0; i<n; i++) cin >> a[i];
  85.  
  86. cout << consistency(n) << endl;
  87.  
  88.  
  89. }
  90.  
  91.  
  92.  
  93.  
  94.  
  95. int32_t main() {
  96. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  97.  
  98. int t = 1;
  99. cin >> t;
  100. while (t--) {
  101. solve();
  102. }
  103.  
  104. return 0;
  105. }
Success #stdin #stdout 0s 5320KB
stdin
2
5
1 5 3 4 -2
9
1 5 -2 2 3 -1 1 0 4
stdout
2
8