We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  • HackerRank Home
  • |
  • Prepare
  • Certify
  • Compete
  • Apply
  • Hiring developers?
  1. Prepare
  2. Tutorials
  3. LinkedIn Placements
  4. Bitwise AND

Bitwise AND

Problem
Submissions
Leaderboard
Discussions
Editorial
Tutorial

Given set . Find two integers, and (where ), from set such that the value of is the maximum possible and also less than a given integer, . In this case, represents the bitwise AND operator.

Input Format

The first line contains an integer, , the number of test cases.
Each of the subsequent lines defines a test case as space-separated integers, and , respectively.

Constraints

Output Format

For each test case, print the maximum possible value of on a new line.

Sample Input

3
5 2
8 5
2 2

Sample Output

1
4
0

Explanation

All possible values of and are:

The maximum possible value of that is also is , so we print on a new line.

Author

AvmnuSng

Difficulty

Easy

Max Score

20

Submitted By

9441

Need Help?


View tutorial
View discussions
View editorial
View top submissions

rate this challenge

MORE DETAILS

Download problem statement
Download sample test cases
Suggest Edits
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Helpdesk
  • Careers
  • Terms Of Service
  • Privacy Policy

Cookie support is required to access HackerRank

Seems like cookies are disabled on this browser, please enable them to open this website