Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

  


Problem Link
 :  https://codeforces.com/contest/1931/problem/D

Solution in C++:

  1. /// Author : AH_Tonmoy
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4. int32_t main() {
  5. ios_base::sync_with_stdio(0);
  6. cin.tie(0);
  7. int t;
  8. cin >> t;
  9. while (t--) {
  10. int n , x , y ; cin >> n >> x >> y ;
  11. vector<int>a(n) ;
  12. long long ans = 0 ;
  13. map<pair<int,int>,int>mp ;
  14. for ( int i = 0 ; i < n ; i++){
  15. cin >> a[i] ;
  16. ans += mp[{(x-a[i]%x)%x,a[i] % y }] ;
  17. mp[{a[i]%x , a[i] % y}]++ ;
  18. }
  19. cout << ans << '\n' ;
  20. }
  21. return 0 ;
  22. }

No comments

Most View Post

Recent post

Codeforces Round 971 (Div. 4) 2009C. The Legend of Freya the Frog Solution

  Problem Link    https://codeforces.com/contest/2009/problem/C S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. h ...

Powered by Blogger.