codeforces 165 Div2 A

A. Fancy Fence time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output

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.

Sample test(s) input 3306090 output NOYESYES 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

代码：

1 #include<iostream> 2 using namespace std; 3 int main( void) 4 { 5 int t, ang, i; 6 7 cin>>t; 8 for( i=0; i<t; i++) 9 { 10 cin>>ang; 11 double ano; 12 double ans; 13 ano=180-ang; 14 ans=360/ano; 15 if( ans==(int)ans) 16 cout<<"YES"<<endl; 17 else 18 cout<<"NO"<<endl; 19 } 20 return 0; 21 }

 

转载于:https://www.cnblogs.com/shadow-justice/archive/2013/02/13/2911028.html