Advertisement
Guest User

Untitled

a guest
Nov 15th, 2019
149
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.66 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. const int MAX = 1e5+9;
  6.  
  7. int q,n,k;
  8. int a[MAX];
  9.  
  10. int main() {
  11. cin >> q;
  12. while(q--){
  13. cin >> n;
  14. for (int i=0;i<4*n;i++)
  15. cin >> a[i];
  16.  
  17. sort(a,a+4*n);
  18. bool cont = false;
  19. int l = 0 , r = 4*n-1;
  20. int s = a[l]*a[r];
  21. while(l<r){
  22. if (s!=a[l]*a[r] || (a[r] != a[r-1] || a[l] != a[l+1])){
  23. cout << "NO\n";
  24. cont = true;
  25. break;
  26. }
  27. l+=2;
  28. r-=2;
  29. }
  30. if (cont)
  31. continue;
  32. cout << "YES\n";
  33. }
  34. return 0;
  35. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement