T - Switch Game

Switch Game

题目描述

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 ).

Iutput

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

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.

---

思路：

找出n的所有因子的个数即可，这意味着第n个数字改变的次数；

---

代码

#include <stdio.h>
int func(int x)
{
    int i;
    int num=0;
    for(i=1;i<=x;i++)
        if(x%i==0)
            num++;
    return num;
}
int main()
{
    int x;
    int num;
    while(scanf("%d",&x)!=EOF){
        num=func(x);
        if(num%2==0)
            printf("0\n");
        else printf("1\n");
    }
    return 0;
}