Thanks

You are right about older version. I tried it on RMI 2.5.0 and it worked.

Small typo:

Find the sum of all integers less than n that have exactly k ones in their binary represetations.

Thanks a lot...

Glad you enjoyed ;-)

Awesome kata to have fun with, great.

Problem sounds very interesting! If you had time and motivation, might add a possibility to work on it in C# :)

Division in this challenge is defined as integer division. It should be always rounded, it's specified this way.

I think the test answers use int during every calculation step not only in the end result. Resulting in rounding prematurely and thus wrong outputs

Thanks, approved

Java translation

Great

Approved

Fork