human
Count pairs with set bits sum equal to K | Function to return the count of set bits in n.
Function to return the count of required pairs.
To store the count.
Sum of set bits in both the integers.
If current pair satisfies the given condition.
Driver code"
How can the above be solved in Python?
 Write me a code to count pairs with set bits sum equal to K and the other steps required?
assistant
#Here is code to count pairs with set bits sum equal to K and the other steps required.
 def countSetBits ( n ) :
	count = 0 ;
	while ( n ) :
		n &= ( n - 1 ) ;
		count += 1
	return count ;
def pairs ( arr , n , k ) :
	count = 0 ;
	for i in range ( n ) :
		for j in range ( i + 1 , n ) :
			sum = countSetBits ( arr [ i ] ) + countSetBits ( arr [ j ] ) ;
			if ( sum == k ) :
				count += 1 ;
	return count ;
if __name__ == " _ _ main _ _ " :
	arr = [ 1 , 2 , 3 , 4 , 5 ] ;
	n = len ( arr ) ;
	k = 4 ;
	print ( pairs ( arr , n , k ) ) ;