poj3372(完全剩余系（不会证）)

http://poj.org/problem?id=3372

Candy Distribution

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5083		Accepted: 2775

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个小孩围成一个圈，老师 顺时针隔 0， 1， 2， 3，。。。个小孩发糖，问每个小孩是否都能领到糖。

解法很简单 当N是2^K时输出YES，否则输出NO。printf((N & N - 1) ? "NO\n" : "YES\n");

技巧：判断n是否为2的幂：n&(n-1)。

别人是证明这个是完全剩余系，我是找规律发现1，2，4，8。。。。差距好大啊。。

完全剩余系：即是通过对一一系列正整数mod m后产生的从0至（m-1）的完全数系。

表示不会证。

#include
#include
#include
using namespace std;
void solve()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        if(n&(n-1))
        {
            //printf("%d\n",n&(n-1));
            printf("NO\n");
        }
        else
        {
            //printf("%d\n",n&(n-1));
            printf("YES\n");
        }
    }
}
int main()
{
    solve();
    return 0;
}