Solution of a problem

#1

https://online.codingblocks.com/player/5104/content/772?s=631

How to solve this?

#2

Can you put your question here , I am not able to access ur question .

#3

We are given two coins of value x and y. We have to find the maximum of value of a XOR b where x <= a <= b <= y.

#4

It’s pretty simple .
First make a loop from a to b for first number and then make a nested loop in it for second number from i+1 to b and find the maximum of all possibilities
Okay take a look in this code
https://ide.codingblocks.com/#/s/22474