binarne clear solution for Binary Count by weroniquue - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

binarne solution in Clear category for Binary Count by weroniquue

def checkio(number):
    wynik= 0
    while number>0:
        wynik=number % 2 + wynik
        number=number//2
    
    return wynik

#These "asserts" using only for self-checking and not necessary for auto-testing
if __name__ == '__main__':
    assert checkio(4) == 1
    assert checkio(15) == 4
    assert checkio(1) == 1
    assert checkio(1022) == 9

Oct. 25, 2016

Comments:

suic on Nov. 1, 2016, 4:47 p.m.
Hi, nice math-based solution. :) few Python tweaks: <ol> <li>`divmod()` is an excellent built-in function.</li> <li>`str` has `str.count()` method, which can do the work for you: `bin(number).count('1')` as `bin()` returns a `str`.</li> </ol> Regards, suic ```python <h1>divmod</h1> def checkio(number): wynik = 0 while number>0: n, w = divmod(number, 2) wynik += w number = n return wynik ```

GitHub

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.