C++ Nega Bit
Submissions: 309   Accuracy:

45.63%

  Difficulty: Basic   Marks: 1

Given two integer numbers, whenever the bits of the first number is set i.e. 1, negate the bits of the second number leaving the rest bits of the second number unchanged. 

Input: 
The first line of input contains integer T denoting the number of test cases. For each test case, there are two integer inputs i.e. f the first number and s the second number whose bits need to be changed according to the set bits
of f

Output:
For each test case, the output is the integer s.  

Constraints:
1<=T<=100
1<=f,s<=1000

Example:
Input:
2
2 5
1 3
Output:
7
2

Explanation:

1. 2 is represented as 10 in binary and 5 is represented as 101.Hence negating the 2nd bit of 5 from right, thus the new number becomes 7 i.e. 111.

2.1-1 and 3-11 in binary, thus negating 1st bit of 3 from right we get 10 i.e. 2.

 

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Vanshika
Author: Vanshika_pec


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.