15,996,250 members
1.00/5 (1 vote)
See more:
```you are given two integers N and K, and you need to find two positive integers X and Y such that:

X<=Y

X & Y & 2^n = 2^n('&' denotes bitwise AND operator)

Y-X=K

As there can be multiple such pairs, choose the one with a minimum value of X and print that value. If no such X exists, print -1.

TASK For each test case, print the minimum value of X satisfying the condition, or -1 if no such value exists.```

What I have tried:

`TASK For each test case, print the minimum value of X satisfying the condition, or -1 if no such value exists.`
Posted
Updated 20-Nov-22 0:28am

## Solution 1

While we are more than willing to help those that are stuck, that doesn't mean that we are here to do it all for you! We can't do all the work, you are either getting paid for this, or it's part of your grades and it wouldn't be at all fair for us to do it all for you.

So we need you to do the work, and we will help you when you get stuck. That doesn't mean we will give you a step by step solution you can hand in!
Start by explaining where you are at the moment, and what the next step in the process is. Then tell us what you have tried to get that next step working, and what happened when you did.

If you are having problems getting started at all, then this may help: How to Write Code to Solve a Problem, A Beginner's Guide[^]