Question

In Java  

Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is:

As long as x is greater than 0
   Output x % 2 (remainder is either 0 or 1)
   x = x / 2

Note: The above algorithm outputs the 0's and 1's in reverse order.

Ex: If the input is:

6

the output is:

011

6 in binary is 110; the algorithm outputs the bits in reverse.

Answer 1

Main.java

import java.util.Scanner;
public class Main
{
   public static void main(String[] args) {
       int n;
       Scanner sc = new Scanner(System.in); //scanner Object
       n = sc.nextInt(); //get input
      
       while(n>0){ //while n is greater than 0
       System.out.print(n%2); //print n%2
       n /= 2; // n = n/2 according to algo
       }
       System.out.println(); //remove this line if you want to remove newline at the end
   }
}

Screenshot of the code:

Output: