大家好，又见面了，我是全栈君。
问题 F: Graph
时间限制: 1 Sec
内存限制: 128 MB
提交: 30
解决: 5
[
论坛]
题目描写叙述
Your task is to judge whether a regular polygon can be drawn only by straightedge and compass.
The length of the straightedge is infinite.
The width of the compass is infinite.
The straightedge does not have scale.
输入
There are several test cases. Each test case contains a positive integer n (3<=n<=10^9). The input will be ended by the End Of File.
输出
If the regular polygon with n sides can be drawn only by straightedge and compass, output YES in one line, otherwise, output NO in one line.
例子输入
例子输出
。
//满足要求的边为 (2^n)*p p为费马素数
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
while(n%2==0)
{
n/=2;
}
if(n==1)
{
printf("YES\n");
continue;
}
if(n%3==0)
n/=3;
if(n%5==0)
n/=5;
if(n%17==0)
n/=17;
if(n%257==0)
n/=257;
if(n%65537==0)
n/=65537;
if(n==1)
{
printf("YES\n");
}
else
printf("NO\n");
}
return 0;
}
发布者：全栈程序员-用户IM，转载请注明出处：https://javaforall.cn/115482.html原文链接：https://javaforall.cn
【正版授权，激活自己账号】： Jetbrains全家桶Ide使用，1年售后保障，每天仅需1毛
【官方授权 正版激活】： 官方授权 正版激活 支持Jetbrains家族下所有IDE 使用个人JB账号...
