cf思维题（给出4*n条边判断能不能构成n个等面积矩形）

Equal Rectangles

You are given 4n4n sticks, the length of the ii-th stick is aiai.

You have to create nn rectangles, each rectangle will consist of exactly 44 sticks from the given set. The rectangle consists of four sides, opposite sides should have equal length and all angles in it should be right. Note that each stick can be used in only one rectangle. Each stick should be used as a side, you cannot break the stick or use it not to the full length.

You want to all rectangles to have equal area. The area of the rectangle with sides aa and bb is a⋅ba⋅b.

Your task is to say if it is possible to create exactly nn rectangles of equal area or not.

You have to answer qq independent queries.

Input
The first line of the input contains one integer qq (1≤q≤5001≤q≤500) — the number of queries. Then qq queries follow.

The first line of the query contains one integer nn (1≤n≤1001≤n≤100) — the number of rectangles.

The second line of the query contains 4n4n integers a1,a2,…,a4na1,a2,…,a4n (1≤ai≤1041≤ai≤104), where aiai is the length of the ii-th stick.

Output
For each query print the answer to it. If it is impossible to create exactly nn rectangles of equal area using given sticks, print “NO”. Otherwise print “YES”.
Example
input
5
1
1 1 10 10
2
10 5 2 10 1 1 2 5
2
10 5 1 10 5 1 1 1
2
1 1 1 1 1 1 1 1
1
10000 10000 10000 10000
output
YES
YES
NO
YES
YES

题意：给你n4条边让你判断能否组成n个面积等大的矩形。
思路：给n4条边排序，因为要面积等大所以每组矩形的非对边相乘都相同，而且每两组边都相同。从小到大排序后最大的肯定和最小的是一组非对边，从小到大每两个为一组对边。

#include <iostream>
#include<algorithm>
#include<bits/stdc++.h>
using namespace std;

int x,y;
int a[550];
int main()
{
    int n;
    int t;
    scanf("%d",&t);
    while(t--)
    {

        scanf("%d",&n);
        for(int i=1;i<=n*4;i++)
        {
            scanf("%d",&a[i]);
        }
        sort(a+1,a+1+4*n);
        int l=1,r=n*4;
        int s=a[l]*a[r];
        int flag=0;
        while(l<r)
        {
            if(a[l]*a[r]!=s)
            {
               
                flag=1;break;

            }
            if(a[l]!=a[l+1]||a[r]!=a[r-1])
            {
                 
                flag=1;break;
            }
            l+=2;
            r-=2;
        }
        if(flag)
        {
            printf("NO\n");
        }
        else
        {
            printf("YES\n");
        }
    }


    return 0;
}