poj3372 Candy Distribution---找规律

最新推荐文章于 2017-02-22 20:02:07 发布

qiqijianglu

最新推荐文章于 2017-02-22 20:02:07 发布

阅读量1.2k

点赞数

分类专栏：数论文章标签： integer input each output

本文链接：https://blog.csdn.net/qiqijianglu/article/details/7932977

版权

数论专栏收录该内容

53 篇文章 0 订阅

订阅专栏

教师按特定规律给围绕圆圈编号的N个孩子分糖果，从第1个和第2个开始，依次跳过1个孩子给下一个糖果，然后跳过2个孩子再给下一个，以此类推。程序需判断所有孩子能否至少得到一颗糖果。输入为正整数N（2≤N≤1,000,000,000），输出为“YES”或“NO”，表示所有孩子是否都能得到糖果。" 5713862,537253,Java 调用 .NET Web Service 教程,"['java开发', 'web服务', '.net开发', '跨平台调用', 'axis']

摘要由CSDN通过智能技术生成

Candy Distribution

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5071		Accepted: 2767

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

Source

POJ Monthly--2007.09.09, ailyanlu@zsu

2的n次幂YES~~~

#include<iostream>
#include<cstdlib>
#include<stdio.h>
#include<math.h>
using namespace std;
int main()
{
    long long n;
    while(scanf("%I64d",&n)!=EOF)
    {
      int cc=0;
      while(1)
      {
          long long res=pow(2,cc+0.0);
          if(res==n){puts("YES");break;}
          if(res>n){puts("NO");break;}
          cc++;
      }
    }
}