XORty

Lesson 15 of 17 in Coddy's Bit Manipulation course.

Challenge

Easy

In order to celebrate KATY's 5th anniversary, Tengen and Sara decided to play a game.

Tengen gave Sara two integers a and b and a really important quest.

In order to complete the quest, Sara has to output the smallest possible value of (a⊕x) + (b⊕x) for any given x, where ⊕ denotes the bitwise XOR operation.

For example a = 6 and b = 12, then Sara can choose x = 4 and the value will be (6⊕4) + (12⊕4) = 2+82+8 = 1010. This is the smallest possible value.

Complete the function XORty () to help Sara find the output and return it.

Try it yourself

using namespace std;

int XORty(int a, int b) {
    // Write code here
}

All lessons in Bit Manipulation

1Introduction and basics

What is bit manipulation?Why we need bit manipulation?Binary and decimal numbers NOT & OR operators AND operator XOR operator Right and left shift operators Bitwise Operators Summary

2Bit Algorithms

Power of 2 Number occurring odd times Number of set-bits Rotate bits of a number I Rotate bits of a number II

3Practice challenges

Tina and her bits assignmentXORtyFind K Find Minimum Sum

Practice on your own: Online C++ compiler