Problem:
Bit Operation II

Given two non-negative decimal integers $a$ and $b$, calculate their AND (logical conjunction), OR (logical disjunction) and XOR (exclusive disjunction) and print them in binary representation of 32 bits.

Input

The input is given in the following format.

$a \; b$

Output

Print results of AND, OR and XOR in a line respectively.

Constraints

$0 \leq a, b \leq 2^{32} - 1$

Sample Input 1

8 10

Sample Output 1

00000000000000000000000000001000
00000000000000000000000000001010
00000000000000000000000000000010

Solution in C# (judge verdict: Accepted)

using System;

public class hello
{
    public static void Main()
    {
        string[] line = Console.ReadLine().Trim().Split(' ');
        var a = long.Parse(line[0]);
        var b = long.Parse(line[1]);
        var ans = new long[3];
        ans[0] = a & b;
        ans[1] = a | b;
        ans[2] = a ^ b;
        for (int i = 0; i < 3; i++)
        {
            var w = Convert.ToString(ans[i], 2);
            Console.WriteLine(format(w));
        }
    }
    public static string format(string s)
    {
        var sL = s.Length;
        string ans;
        if (sL < 32) ans = new string('0', 32 - sL) + s;
        else ans = s.Substring(sL - 32);
        return ans;
    }
}