hdu 2053

Switch Game

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

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 …The later operations cannot change the condition of the fifth lamp any more. So the answer is 0.

/*思路:看过紫书的新手很容易被这题提示坑了..如果按照紫书的做法然后再判断百分百超时。其实这题就是判断一下n的因数。 */import java.util.Scanner;public class Main{public static void main(String[] args) {Scanner cin = new Scanner(System.in);while(cin.hasNext()){int n=cin.nextInt();int cnt=0;for(int i=1;i<=n;++i)if(n%i==0)cnt^=1;System.out.println(cnt);}cin.close();}}