title: how many distinct numbers can be generated by doing bitwise OR of one or more integers between A and B (inclusive)
body: <p>How many distinct numbers can be generated by doing bitwise OR of one or more integers between A and B (inclusive)?
  <br></p>
  
  <p>Explanation:
  In this case, A=7 and B=9. There are four integers that can be generated doing the bitwise OR of a non-empty subset of {7, 8, 9}: 7, 8, 9 and 15 
  1≤A≤B&lt;2^60
  <br></p>
  
  <p>My approach:
  Converted both the given numbers to binary. Iterated through them and tried to form different conditions. But I am not getting numbers of distinct integers. Please help me out how to develop the algorithm and program for this.</p>