Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 131072/131072 K (Java/Others)

Who is Dylans?You can find his ID in UOJ and Codeforces.

His another ID is s1451900 in BestCoder.

And now today's problems are all about him.

Dylans is given a number $N$.

He wants to find out how many groups of "1" in its Binary representation.

If there are some "0"（at least one）that are between two "1",

then we call these two "1" are not in a group,otherwise they are in a group.

His another ID is s1451900 in BestCoder.

And now today's problems are all about him.

Dylans is given a number $N$.

He wants to find out how many groups of "1" in its Binary representation.

If there are some "0"（at least one）that are between two "1",

then we call these two "1" are not in a group,otherwise they are in a group.

提交代码