欢迎访问 生活随笔!

生活随笔

当前位置: 首页 > 编程资源 > 编程问答 >内容正文

编程问答

【CodeForces - 270A】Fancy Fence (几何,思维,水题)

发布时间:2023/12/10 编程问答 35 豆豆
生活随笔 收集整理的这篇文章主要介绍了 【CodeForces - 270A】Fancy Fence (几何,思维,水题) 小编觉得挺不错的,现在分享给大家,帮大家做个参考.

题干:

Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.

He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence corners at a single angle a.

Will the robot be able to build the fence Emuskald wants? In other words, is there a regular polygon which angles are equal to a?

Input

The first line of input contains an integer t (0 < t < 180) — the number of tests. Each of the following t lines contains a single integer a (0 < a < 180) — the angle the robot can make corners at measured in degrees.

Output

For each test, output on a single line "YES" (without quotes), if the robot can build a fence Emuskald wants, and "NO" (without quotes), if it is impossible.

Examples

Input

3 30 60 90

Output

NO YES YES

Note

In the first test case, it is impossible to build the fence, since there is no regular polygon with angle .

In the second test case, the fence is a regular triangle, and in the last test case — a square.

 

题目大意:

一条线,每次只能逆时针转a度,问你是否可以恰好转回来构成一个多边形。(可以用来训练一下读题?)

解题报告:

   用180-a度,转化成内角的度数,判断360可否正好整除这个度数就可以了。

AC代码:

#include<cstdio> #include<iostream> #include<algorithm> #include<queue> #include<map> #include<vector> #include<set> #include<string> #include<cmath> #include<cstring> #define ll long long #define pb push_back #define pm make_pair #define fi first #define se second using namespace std; const int MAX = 2e5 + 5;int main() {int t,x;cin>>t;while(t--) {scanf("%d",&x);x=180-x;if(360%x == 0) puts("YES");else puts("NO"); }return 0 ;}

 

总结

以上是生活随笔为你收集整理的【CodeForces - 270A】Fancy Fence (几何,思维,水题)的全部内容,希望文章能够帮你解决所遇到的问题。

如果觉得生活随笔网站内容还不错,欢迎将生活随笔推荐给好友。