fork download
  1. #include<bits/stdc++.h>
  2. #define TIME (1.0* clock()/CLOCKS_PER_SEC)
  3. #define pb push_back
  4. #define eb emplace_back
  5. #define id1 (id<<1)
  6. #define id2 (id<<1)|1
  7. #define ll long long
  8. #define ii pair<int,int>
  9. #define vi vector<int>
  10. #define vii vector<pair<int,int>>
  11. #define vl vector<long long>
  12. #define vll vector <pair<ll,ll>>
  13. #define li pair<long long,int>
  14. #define vil vector <pair<int,ll>>
  15. #define db double
  16. #define ff first
  17. #define ss second
  18. #define lb lower_bound
  19. #define ub upper_bound
  20. #define FOR(i, a, b) for (int i = (a); i <=(b); i++)
  21. #define F0R(i, a) FOR(i, 0, a-1)
  22. #define ROF(i, a, b) for (int i = (b); i >= (a); i--)
  23. #define R0F(i, a) ROF(i, 0, a-1)
  24. #define rep(a) F0R(_, a)
  25. #define each(a, x) for (auto &a : x)
  26. #define ALL(x) (x).begin(),(x).end()
  27. #define pq priority_queue <li, vector <li>, greater <li>>
  28. using namespace std;
  29. const int maxn=1e6;
  30. //const int MOD=1e9+7;
  31. //const int MOD=998244353;
  32. //const int dx[4]{1, 0, -1, 0}, dy[4]{0, 1, 0, -1};
  33. #define int long long
  34. int n,d;
  35. int res;
  36.  
  37. int a[maxn],pre[maxn],cnt[maxn];
  38.  
  39.  
  40. void solve(){
  41. cin>>n>>d;
  42. cnt[pre[0]]=1;
  43. for(int i=1;i<=n;i++){
  44. int x;
  45. cin>>x;
  46. pre[i]=pre[i-1]+x;
  47. pre[i]=((pre[i]%d)+d)%d;
  48. res+=cnt[pre[i]];
  49. cnt[pre[i]]++;
  50.  
  51. }
  52. cout<<res;
  53. return;
  54. }
  55. signed main(){
  56. ios_base::sync_with_stdio(false);
  57. cin.tie(NULL);cout.tie(NULL);
  58. if (fopen("TASK.INP", "r")){
  59. freopen("TASK.INP", "r", stdin);
  60. freopen("TASK.OUT", "w", stdout);
  61. }
  62. int ntest;
  63. ntest=1;
  64. cin>>ntest;
  65.  
  66. for(int i=1;i<=ntest;i++) solve();
  67. cerr<<"\n"<<"Time elapsed "<<TIME<<"s.\n";
  68. return 0;
  69. }
Success #stdin #stdout #stderr 0.01s 5316KB
stdin
5 4
1 3 -2 3 -5
stdout
1020304050
stderr
Time elapsed 0.005197s.