HDOJ--2053

 

Switch Game

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

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.
  
  

 

找规律即可，主要是判断是奇还是偶数。

以下是我的AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
    int n;
    while(cin>>n)
    {
        int num=0,half=n/2;
        if(n!=1)
        for(int i=1;i<=half;i++)
        {
            
            if(n%i==0)
            {
                if(n/i!=i)
                num+=2;
                else
                num++;
            }
            
            
        }
        else
        num=1;
        if(num%2==0)
        cout<<"0"<<endl;
        else
        cout<<"1"<<endl;
    }
    return 0;
}