hdoj 2053 Switch Game

Switch Game

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

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

15

 

Sample Output

10
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 …
开关灯，理解题意就好
代码：
#include <iostream>#include <cstdio>using namespace std;int main(){    int n;    while(~scanf("%d",&n))    {        int ans=0;        for(int i=1;i<=n;i++)        {            if(n%i==0)                ans++;        }        if(ans%2==0)            printf("0\n");        else            printf("1\n");    }    return 0;}