poj3372-Candy Distribution解题报告
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
解题思路:
在poj做这个题目时,我看了一下别人对这个题目的讨论,很多人说是数论中的完全剩余系。但是我不懂,只知道如果n是2的幂就可以满足,所以这里就不证明了(ps:数论还是要好好学的)。可以说这题完全是蒙过去的.......(挺丢脸的)。之后我在讨论中看到了判断n是否为2的幂的一个公式,如果(n&(n-1))==0那么n就是2的幂。借助这个公式就可以很快的把这个题目给AC了。
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<string.h>
int main()
{
int n;
while(~scanf("%d",&n))
{
if((n&(n-1))==0)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}