Codeforces Contest 1096 problem C Polygon for the Angle——多边形最小∠

You are given an angle ang.

The Jury asks You to find such regular n-gon (regular polygon with n vertices) that it has three vertices a, b and c (they can be non-consecutive) with ∠abc=ang or report that there is no such n-gon.

If there are several answers, print the minimal one. It is guarantied that if answer exists then it doesn’t exceed 998244353.

Input
The first line contains single integer T (1≤T≤180) — the number of queries.

Each of the next T lines contains one integer ang (1≤ang<180) — the angle measured in degrees.

Output
For each query print single integer n (3≤n≤998244353) — minimal possible number of vertices in the regular n-gon or −1 if there is no such n.

Example
inputCopy
4
54
50
2
178
outputCopy
10
18
90
180
Note
The answer for the first query is on the picture above.

The answer for the second query is reached on a regular 18-gon. For example, ∠v2v1v6=50∘.

The example angle for the third query is ∠v11v10v12=2∘.

In the fourth query, minimal possible n is 180 (not 90).

题意：

让你输出三个点可以组成k°的多边形是正几边形。

题解：

正多边形最大角：(n-2)*180/2，最小角：(180-最大角)/2，并且所有角都是最小角的倍数，预处理之后找一遍即可。

#include<bits/stdc++.h>
using namespace std;
struct node
{
    double mi,ma;
}ang[365];
int main()
{
    int t;
    scanf("%d",&t);
    for(int i=1;i<=360;i++)
        ang[i].ma=(double)(i-2)*180/i,ang[i].mi=(double)(180-ang[i].ma)/2;
    while(t--)
    {
        int n;
        scanf("%d",&n);
        int ans=-1;
        int flag=0;
        for(int i=1;i<=360;i++)
        {
            for(int j=1;ang[i].mi*j<=ang[i].ma;j++)
            {
                if(ang[i].mi*j==(double)n)
                {
                    flag=1,ans=i;
                    break;
                }
            }
            if(flag)
                break;
        }
        printf("%d\n",ans);
    }
    return 0;
}