cf#579 B

http://codeforces.com/contest/1203/problem/B
B. Equal Rectangles
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given 4n sticks, the length of the i-th stick is ai.

You have to create n rectangles, each rectangle will consist of exactly 4 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 a and b is a⋅b.

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

You have to answer q independent queries.

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

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

The second line of the query contains 4n integers a1,a2,…,a4n (1≤ai≤104), where ai is the length of the i-th stick.

Output
For each query print the answer to it. If it is impossible to create exactly n rectangles of equal area using given sticks, print “NO”. Otherwise print “YES”.

Example
inputCopy
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
outputCopy
YES
YES
NO
YES
YES
给一个4n长度的数组,问能否组成n个面积相等的矩形,输入数组之后排个序,然后压缩成一个2n的数组,因为如果用b2*b2n的话,b1乘任意一个数都不可能与之相等,所以遍历一次即可

#include<stdio.h>
#include<algorithm>
using namespace std;
int n,q,a[405],b[205];
int main()
{
	scanf("%d",&q);
	while(q--)
	{
		scanf("%d",&n);
		int cnt=4*n;
		for(int i=1;i<=cnt;i++)
		scanf("%d",a+i);
		sort(a+1,a+cnt+1);
		int i;
		for(i=1;i<cnt;i+=2)
		{
			if(a[i]!=a[i+1])
			break;
			b[(i+1)/2]=a[i];
		}
		if(i<cnt)
		{
			printf("NO\n");
			continue;
		}
		int flag=b[n]*b[n+1];
		for(i=1;i<n;i++)
		{
			if(b[i]*b[2*n-i+1]!=flag)
			break;
		}
		if(i<n)
		{
			printf("NO\n");
			continue;
		}
		else
		{
			printf("YES\n");
			continue;
		}
	}
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值