Switch Game
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8788 Accepted Submission(s): 5237
Problem DescriptionThere 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 ).
InputEach test case contains only a number n ( 0< n<= 10^5) in a line.
OutputOutput the condition of the n-th lamp after infinity operations ( 0 - off, 1 - on ).
Sample Input
15
Sample Output
10
import java.io.*;import java.util.*;public class Main {public static int m=(int)Math.pow(10,5);public static int a[]=new int[m+1];public static void main(String[] args) {Scanner sc=new Scanner(new BufferedInputStream(System.in));for(int i=1;i<=m;i++){for(int j=i;j<=m;j+=i){if(a[j]==0){a[j]=1;}else a[j]=0;}}while(sc.hasNextInt()){int n=sc.nextInt();System.out.println(a[n]);}}}