CF1369A.FashionabLee
入门
通过率:0%
时间限制:2.00s
内存限制:256MB
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Lee is going to fashionably decorate his house for a party, using some regular convex polygons...
Lee thinks a regular n-sided (convex) polygon is beautiful if and only if he can rotate it in such a way that at least one of its edges is parallel to the OX-axis and at least one of its edges is parallel to the OY-axis at the same time.
Recall that a regular n-sided polygon is a convex polygon with n vertices such that all the edges and angles are equal.
Now he is shopping: the market has t regular polygons. For each of them print YES if it is beautiful and NO otherwise.
Lee 计划用一些正凸多边形来时尚地装饰他的房子,以迎接一场派对……
Lee 认为,一个正 n 边(凸)多边形是“美丽的”,当且仅当他可以对其进行旋转,使得至少有一条边与 OX 轴平行,且至少有一条边与 OY 轴平行,这两个条件同时成立。
回顾一下:正 n 边形是指具有 n 个顶点的凸多边形,其所有边长和所有内角均相等。
现在他正在采购:市场上共有 t 个正多边形。对其中每一个,若它是美丽的,则输出 YES;否则输出 NO。
输入格式
The first line contains a single integer t (1≤t≤104) — the number of polygons in the market.
Each of the next t lines contains a single integer ni (3≤ni≤109): it means that the i-th polygon is a regular ni-sided polygon.
第一行包含一个整数 t(1≤t≤104)—— 表示市场上多边形的数量。
接下来的 t 行中,每行包含一个整数 ni(3≤ni≤109):表示第 i 个多边形是一个正 ni 边形。
输出格式
For each polygon, print YES if it's beautiful or NO otherwise (case insensitive).
对于每个多边形,如果它是优美的,则输出 YES,否则输出 NO(不区分大小写)。
输入输出样例
输入#1
4 3 4 12 1000000000
输出#1
NO YES YES YES
说明/提示
In the example, there are 4 polygons in the market. It's easy to see that an equilateral triangle (a regular 3-sided polygon) is not beautiful, a square (a regular 4-sided polygon) is beautiful and a regular 12-sided polygon (is shown below) is beautiful as well.

示例中有 4 个市场中的多边形。容易看出,等边三角形(即正 3 边形)不是“优美”的,而正方形(即正 4 边形)是“优美”的,正 12 边形(如下图所示)也是“优美”的。

输入解题思路,AI测评打分。不知道怎么写?