我爱codewars

依旧只是个可爱的搬运工

题目：

Binary multiple of 3

解决方法：

判断二进制数能否被3整除的方法

题目：

Given two numbers: 'left' and 'right' (1 <= 'left' <= 'right' <= 1 000 000 000) return sum of all '1' occurencies in binary representations of numbers between 'left' and 'right' (including both)

解决方法：