Bitset

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

Problem Description

Give you a number on base ten,you should output it on base two.(0 < n < 1000)

Input

For each case there is a postive number n on base ten, end of file.

Output

For each case output a number on base two.

Sample Input

1
2
3

Sample Output

1
10
11

import java.util.Scanner;

public class Bitset {
  public static void main(String[] args) {//直接調用Integer.toBinaryString(int i)
    Scanner sc=new Scanner(System.in);  //以二進制无符号整数返回一个整数参数的字符串形式
    while(sc.hasNext()){
      int n=sc.nextInt();
      System.out.println(Integer.toBinaryString(n));
    }
  }
}