BitCounting.py

# Write a function that takes an integer as input, and returns the number of bits that are equal to one in the binary representation of that number. You can guarantee that input is non-negative.

# Example: The binary representation of 1234 is 10011010010, so the function should return 5 in this case

def count_bits(n):
    return bin(n).count("1")


# so for this problem we are giving the binary represention of the given integer. the problem only wants us to count the bits, 
# so we can use coount to count how many times 1 appears and return that.