human
Check whether all the bits are unset in the given range | function to check whether all the bits are unset in the given range or not.
calculating a number ' num ' having ' r ' number of bits and bits in the range l to r are the only set bits.
new number which could only have one or more set bits in the range l to r and nowhere else.
if true , then all bits are unset in the given range.
else all bits are not unset in the given range.
Driver Code"
How can the above be solved in Python?
assistant
#Here is code to check whether all the bits are unset in the given range and the other steps required.
 def allBitsSetInTheGivenRange ( n , l , r ) :
	num = ( ( ( 1 << r ) - 1 ) ^ ( ( 1 << ( l - 1 ) ) - 1 ) )
	new_num = n & num
	if ( new_num == 0 ) :
		return True
	return false
n = 17
l = 2
r = 4
if ( allBitsSetInTheGivenRange ( n , l , r ) ) :
	print ( " Yes " )
else :
	print ( " No " )