fork download
  1. #include <bits/stdc++.h>
  2. #include <chrono>
  3. using namespace std;
  4. using namespace chrono;
  5. // "AJEET JAIN"----"JAI JINENDRA"
  6. /* "णमो अरिहंताणं",
  7.   "णमो सिद्धाणं",
  8.   "णमो आयरियाणं",
  9.   "णमो उवज्झायाणं",
  10.   "णमो लोए सव्वसाहूणं",
  11.   "",
  12.   "एसो पंच नमोक्कारो, सव्व पावप्पणासणो",
  13.   "मंगलाणं च सव्वेसिं, पडमं हवै मंगलं", */
  14.  
  15.  
  16. // Aliases to op
  17. using ll = long long;
  18. using ull = unsigned long long;
  19. using ld = double;
  20. using vll = vector<ll>;
  21.  
  22.  
  23. // Constants
  24. constexpr ll INF = 4e18;
  25. constexpr ld EPS = 1e-9;
  26. constexpr ll MOD = 1e9 + 7;
  27.  
  28.  
  29.  
  30. // Macros
  31. #define F first
  32. #define S second
  33. #define all(x) begin(x), end(x)
  34. #define allr(x) rbegin(x), rend(x)
  35. #define py cout<<"YES\n";
  36. #define pn cout<<"NO\n";
  37. #define forn(i,n) for(int i=0;i<n;i++)
  38. #define for1(i,n) for(int i=1;i<=n;i++)
  39.  
  40. // #define insert push_back
  41. #define pb push_back
  42. #define MP make_pair
  43. #define endl '\n'
  44.  
  45. /*
  46.   remove substring or subarray ---> try to think about sliding w
  47.  
  48.   */
  49.  
  50. /*
  51.  
  52.   Golden Rule
  53.  
  54.   1) problem is easy
  55.   2) proofs is easy
  56.   3) implementation is easy
  57.  
  58.   /*
  59.   ROUGH --
  60.   (p[j]%k -j%k + k)%k == (p[i-1]%k -i%k + 1%k + k)%k
  61.  
  62.   */
  63.  
  64. void AJNJ(){
  65. ll n,k;
  66. cin>>n>>k;
  67. vector<ll> v(n + 1 , 0) , pre(n + 1 , 0);
  68. for(int i = 1 ; i <= n ; i++){
  69. cin >> v[i];
  70. pre[i] = pre[i - 1] + v[i];
  71. }
  72. unordered_map<ll , ll> mp;
  73. ll ans = 0;
  74. mp[0] = 1;
  75.  
  76. for(int j = 1 ; j <= n ; j++){
  77. ll x = ((pre[j] % k -j % k + k) % k);
  78. if(mp.find(x) != mp.end()){
  79. ans += mp[x];
  80. }
  81. mp[x]++;
  82. }
  83.  
  84. cout << ans << endl;
  85.  
  86. }
  87.  
  88.  
  89. int main(){
  90. ios::sync_with_stdio(0);
  91. cin.tie(0);
  92. cout.tie(0);
  93. int T = 1;
  94. cin>>T;
  95. auto start1 = high_resolution_clock::now();
  96. while(T--){
  97. AJNJ();
  98. }
  99. auto stop1 = high_resolution_clock::now();
  100. auto duration = duration_cast<microseconds>(stop1 - start1);
  101. cerr << "Time: " << duration . count() / 1000 << " ms" << endl;
  102.  
  103. return 0;
  104. }
Success #stdin #stdout #stderr 0s 5320KB
stdin
Standard input is empty
stdout
0
stderr
Time: 0 ms