规律题_1

最新推荐文章于 2020-12-24 08:59:49 发布

x-inda

最新推荐文章于 2020-12-24 08:59:49 发布

阅读量358

点赞数

分类专栏：算法 acm

本文链接：https://blog.csdn.net/liangxingda/article/details/52120752

版权

算法 acm 专栏收录该内容

46 篇文章 0 订阅

订阅专栏

Description

N children standing in circle who are numbered 1 through N clockwise are waiting their candies. Their teacher distributes the candies by in the following way:

First the teacher gives child No.1 and No.2 a candy each. Then he walks clockwise along the circle, skipping one child (child No.3) and giving the next one (child No.4) a candy. And then he goes on his walk, skipping two children (child No.5 and No.6) and giving the next one (child No.7) a candy. And so on.

Now you have to tell the teacher whether all the children will get at least one candy?

Input

The input consists of several data sets, each containing a positive integer N (2 ≤ N ≤ 1,000,000,000).

Output

For each data set the output should be either "YES" or "NO".

Sample Input

2
3 
4

Sample Output

YES
NO
YES

属于规律题，可以尝试打表发现规律，当n是2的指数幂时YES

<pre name="code" class="cpp">#include<iostream>
#include<cstring>
using namespace std;


int main()
{
    int n;
    while(cin>>n)
    {
      while(n%2==0){
        n=n/2;
      }
      if(n==1) cout<<"YES"<<endl;
      else  cout<<"NO"<<endl;
    }
    return 0;
}