HDU2053 Switch Game

2053

Switch Game

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 18846 Accepted Submission(s): 11551

Problem Description

There are many lamps in a line. All of them are off at first. A series of operations are carried out on these lamps. On the i-th operation, the lamps whose numbers are the multiple of i change the condition ( on to off and off to on ).

Input
Each test case contains only a number n ( 0< n<= 10^5) in a line.

Output
Output the condition of the n-th lamp after infinity operations ( 0 - off, 1 - on ).

Sample Input
1
5

Sample Output
1
0

Hint
hint

Consider the second test case:

The initial condition : 0 0 0 0 0 …
After the first operation : 1 1 1 1 1 …
After the second operation : 1 0 1 0 1 …
After the third operation : 1 0 0 0 1 …
After the fourth operation : 1 0 0 1 1 …
After the fifth operation : 1 0 0 1 0 …

The later operations cannot change the condition of the fifth lamp any more. So the answer is 0.

Author
LL

Source
校庆杯Warm Up

Recommend
linle | We have carefully selected several similar problems for you: 2052 2056 2054 2057 2055

---

本题就是将排列的灯按1~n的顺序将其在i的倍数的开关翻转一次

---

所有的质数只有1和质数本身两个公约数；
所有的合数，除了是某个数的平方数外，其公约数个数一定是成对出现的，如32，其公约数为1,2,4,8,16,32；
只有平方数，其公约数一定为奇数个，如36,其公约数为1,2,3,4,6,9,12,18,36,中间的6是不配对的，所以一定为奇数个.

//判断一个数是否为完全平方数
#include <cmath>
bool isSqr(int n)
{
    int a = (int)(sqrt(n) + 0.5);
    return a * a == n;
}

#include <stdio.h>
#include <cmath>
bool isSqr(int n)
{
    int a = (int)(sqrt(n) + 0.5);
    return a * a == n;
}
int main()
{
    int n;
    while (scanf("%d", &n)!=EOF)
    {
        if (isSqr(n))
            printf("1\n");
        else printf("0\n");
    }
    return 0;
}