CodeForces 270AFancy Fence 【math 】

最新推荐文章于 2021-02-28 19:47:12 发布

原创最新推荐文章于 2021-02-28 19:47:12 发布 · 323 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种算法，用于判断机器人能否根据给定的角度构建出正多边形围栏。通过简单的数学运算，我们可以得出结论并实现相应的程序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A. Fancy Fence
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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.

Examples
inputCopy
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.

思路：题意就是给定一个度数，看是否能有组成正多边形（ regular polygon）
记住公式吧。如果360%(180-angle) == 0 那么就可以

#include<iostream>
using namespace std;
int main() 
{
    int t;
    cin>>t;
    int angle;
    for(int i = 0;i<t;i++)
    {
        cin>>angle;
        if(360%(180-angle) == 0) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}