Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const int MAX = 1e5+9;
- int q,n,k;
- int a[MAX];
- int main() {
- cin >> q;
- while(q--){
- cin >> n;
- for (int i=0;i<4*n;i++)
- cin >> a[i];
- sort(a,a+4*n);
- bool cont = false;
- int l = 0 , r = 4*n-1;
- int s = a[l]*a[r];
- while(l<r){
- if (s!=a[l]*a[r] || (a[r] != a[r-1] || a[l] != a[l+1])){
- cout << "NO\n";
- cont = true;
- break;
- }
- l+=2;
- r-=2;
- }
- if (cont)
- continue;
- cout << "YES\n";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement