Phoenix and Puzzletime（什么类型吗不晓得嘛）

最新推荐文章于 2022-04-02 20:45:57 发布

牛郎恋刘娘，刘娘念牛郎

最新推荐文章于 2022-04-02 20:45:57 发布

阅读量129

点赞数 2

分类专栏：题目

本文链接：https://blog.csdn.net/qq_52172364/article/details/116375184

版权

题目专栏收录该内容

56 篇文章 1 订阅

订阅专栏

Phoenix and Puzzletime

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Phoenix is playing with a new puzzle, which consists of n identical puzzle pieces. Each puzzle piece is a right isosceles triangle as shown below.
在这里插入图片描述

A puzzle piece
The goal of the puzzle is to create a square using the n pieces. He is allowed to rotate and move the pieces around, but none of them can overlap and all n pieces must be used (of course, the square shouldn’t contain any holes as well). Can he do it?

Input
The input consists of multiple test cases. The first line contains an integer t (1≤t≤104) — the number of test cases.

The first line of each test case contains an integer n (1≤n≤109) — the number of puzzle pieces.

Output
For each test case, if Phoenix can create a square with the n puzzle pieces, print YES. Otherwise, print NO.

Example
inputCopy
3
2
4
6
outputCopy
YES
YES
NO
Note
For n=2, Phoenix can create a square like this:
在这里插入图片描述

For n=4, Phoenix can create a square like this:

在这里插入图片描述

For n=6, it is impossible for Phoenix to create a square.

题意：
一个正方形能否由n个相同的等腰直角三角形构成

思路：
一个最基本的判别方式如果n等于2的n次方是ok的因为总是切分
2大正方形由小正方形构成我们需要知道能够组成几个小正方形
小正方形的个数是否为一个平方数
因为如果小正方形的个数为平方数的话那么正好可以组成一个大的正方形
由于找小正方形不知道是哪一个所以遍历一波即可

#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include<queue>
#define inf 1e9
using namespace std;
typedef long long ll;
ll n,m,k;
const int maxn=1e6+199;

int main(){
	
	int _;
	cin>>_;
	while(_--){
		
		cin>>n;
		if(n&1){
			cout<<"NO"<<endl;
			continue;
		} 
		int flag=0;
		m=n;
		while(n){
			if(n%2!=0&&n!=1){
				flag=1;
				break;
			}
			n/=2;
		}
		if(flag){
			int bj=0;
			double a[100];
			a[0]=1;
			
			for(int i=1;i<=10;i++){
				a[i]=a[i-1]*2;
			}
			for(int i=1;i<=10&&a[i]<m;i++)
			if(int(sqrt(m/a[i]))*int(sqrt(m/a[i]))==m/a[i]){
				bj=1;
				break;
			}
			if(bj){
				cout<<"YES"<<endl;
			}else{
				cout<<"NO"<<endl;
			}
			
		}else{
			cout<<"YES"<<endl;
		}
	}
	return 0;
}```