Maximum steps to transform 0 to X with bitwise AND | CPP code to find the maximum possible effort ; Function to get no of set bits in binary representation of positive integer n ; Driver code
#include <bits/stdc++.h> NEW_LINE using namespace std ; unsigned int countSetBits ( unsigned int n ) { unsigned int count = 0 ; while ( n ) { count += n & 1 ; n >>= 1 ; } return count ; } int main ( ) { int i = 3 ; cout << countSetBits ( i ) ; return 0 ; }