Bitwise Operators Demo

/*
 * Problem : Bitwise results.
 * Input   : Two integers.
 * Output  : Six lines.
 * Approach: Use the operators.
 * Time    : O(1)
 * Space   : O(1)
 * Java    : 8 or newer.
 */
import java.util.Scanner;

public class Main {
    // This method solves the task. It receives the input and returns the answer.
    static String[] solve(long a, long b) {
        // Step 1: Each operator works on the bits of the numbers.
        // & keeps a bit only when both numbers have it. | keeps it when one of them has it.
        // ^ keeps it when exactly one of them has it.
        // Step 2: ~a flips every bit, so the result is -a - 1. << 1 doubles the number, >> 1 halves it (rounded down).
        return new String[] {
            "and=" + (a & b),
            "or=" + (a | b),
            "xor=" + (a ^ b),
            "not-a=" + (~a),
            "a-shift-left=" + (a << 1),
            "a-shift-right=" + (a >> 1)
        };
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        long a = scanner.nextLong();
        long b = scanner.nextLong();
        System.out.println(String.join("\n", solve(a, b)));
    }
}