Given an integer N and an integer D, rotate the binary representation of the integer N by D digits to the left as well as right and print the results in decimal values after each of the rotation. Note: Integer N is stored using 16 bits. i.e. 12 will be stored as 0000.....001100.   Example 1:   Input: N = 28, D = 2 Output: 112 7 Explanation: 28 in Binary is: 000...011100 Rotating left by 2 positions, it becomes 00...1110000 = 112 (in decimal). Rotating right by 2 posit

Read integers from input until an integer read is less than or equal to the previous integer read. For each integer read, output the integer followed by " is in a strictly increasing sequence." Then, output the last integer read followed by "breaks the sequence." End each output with a newline. Ex: If the input is -1 0 1 -5 3 4, then the output is: -1 is in a strictly increasing sequence. 0 is in a strictly increasing sequence. 1 is in a strictly increasing sequence. -5 breaks the sequence. Note: Input has at least two integers. 1 #include HNm LÔ 10 mm CO GI 2 using namespace std; 3 4 int main() { 5 6 7 8 9 10 11} int current Data; int previousData; * Your code goes here */ return 0;

Java - Convert to Reverse Binary

To format output data using format specifiers (for example %3d or %5.2f), we use this method. print printf println output