可恶的吹蜡烛

Problem C
Time Limit: 1000 MS Memory Limit: 32 MB 64bit IO Format: %I64d
Submitted: 53 Accepted: 32
[Submit][Status][Web Board]
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

到达一定的操作次数，其状态将不会被改变

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