杭电ACM2053java做法

Switch Game

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


Hinthint 


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.

网上找了找，发现这两篇写的都挺好的，贴上网址http://blog.csdn.net/xujinsmile/article/details/7832548

http://blog.sina.com.cn/s/blog_69fc13c50100ldlx.html

做法1

import java.util.Scanner;

public class Main {
    public static void main(String[] args){
        Scanner scanner=new Scanner(System.in);
        while(scanner.hasNextInt()){
            int num=scanner.nextInt();
            int n=0;
            for(int i=1;i<=num;i++){
                if(num%i==0){
                    if(n==0) n=1;
                    else n=0;
                }
            }
            if(n==0){
                System.out.println(n);
            }
            else{
                System.out.println("1");
            }
        }
    }
}

做法2

import java.util.Scanner;

public class Main{
    public static void main(String[] args){
        Scanner scanner=new Scanner(System.in);
        while(scanner.hasNextInt()){
            int num=scanner.nextInt();
            double y = Math.sqrt(num);
            if ((y - (int)y) == 0) {
                System.out.println("1");
            }
            else{
                System.out.println("0");
            }
        }
    }
}