A. Fancy Fence
time limit per test
memory limit per test
input
output
Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.
a.
a?
Input
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
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.
分析：利用正多边形的一个角的补角，判断是否符合条件，正多边形的角的补角和为360°。
#include<stdio.h>
#include<map>
#include<string>
using namespace std;
int main()
{
int t,a;
scanf("%d",&t);
while(t--)
{
scanf("%d",&a);
if(360%(180-a)==0)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
