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 nn-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 OXOX-axis and at least one of its edges is parallel to the OYOY-axis at the same time.

Recall that a regular nn-sided polygon is a convex polygon with nn vertices such that all the edges and angles are equal.

Now he is shopping: the market has tt regular polygons. For each of them print YES if it is beautiful and NO otherwise.

Lee 计划用一些正凸多边形来时尚地装饰他的房子,以迎接一场派对……

Lee 认为,一个正 nn 边(凸)多边形是“美丽的”,当且仅当他可以对其进行旋转,使得至少有一条边与 OXOX 轴平行,且至少有一条边与 OYOY 轴平行,这两个条件同时成立。

回顾一下:正 nn 边形是指具有 nn 个顶点的凸多边形,其所有边长和所有内角均相等。

现在他正在采购:市场上共有 tt 个正多边形。对其中每一个,若它是美丽的,则输出 YES;否则输出 NO。

输入格式

The first line contains a single integer tt (1≤t≤1041 \le t \le 10^4) — the number of polygons in the market.

Each of the next tt lines contains a single integer nin_i (3≤ni≤1093 \le n_i \le 10^9): it means that the ii-th polygon is a regular nin_i-sided polygon.

第一行包含一个整数 tt(1≤t≤1041 \le t \le 10^4)—— 表示市场上多边形的数量。

接下来的 tt 行中,每行包含一个整数 nin_i(3≤ni≤1093 \le n_i \le 10^9):表示第 ii 个多边形是一个正 nin_i 边形。

输出格式

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 44 polygons in the market. It's easy to see that an equilateral triangle (a regular 33-sided polygon) is not beautiful, a square (a regular 44-sided polygon) is beautiful and a regular 1212-sided polygon (is shown below) is beautiful as well.

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

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

首页