poj 3372 Candy Distribution（完全剩余系）

Candy Distribution

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5448		Accepted: 3002

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

题意：老师分n颗糖给n个小朋友（围成圈），首先分1颗，然后跳过0个小朋友，再分1颗，然后跳过1个小朋友，再分1颗，然后跳过2个小朋友……如何类推

题解：超级大水题，超级大难题。。。如果打一些数出来看规律就简单，如果要证明就难

这里有一个证明，不知道对不对的，我反正没耐心看完，因为我知道比赛的时候我没那么多时间证。。 http://hi.baidu.com/bfcdygoporbjuxr/item/057b56b644f34841ba0e1223

代码极短。。。就判一下是不是2的n次方

#include<stdio.h>
int main()
{
    int a;

    while(scanf("%d",&a)>0)
    {
        printf("%s\n",a&(a-1)?"NO":"YES");
    }

    return 0;
}