HDU2053Switch Game

本文章仅用于笔记。部分知识点来源于网络，授权请联系作者（[e-mail]）。

题目

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          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.

解题

import java.util.Scanner;public class HDU2053{//Switch Gamepublic static void main(String[] args){ Scanner s=new Scanner(System.in);          while(s.hasNext()){              int n=s.nextInt();              int sum=0;              for(int i=1;i<=n;i++)            {                  if(n%i==0)                      sum+=1;              }              if(sum%2==0)                  System.out.println(0);              else                  System.out.println(1);          }  }}

求来波关注！ 谢谢啦0.0！

小小小作者 

@Fanny0602