Dylans loves numbers

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.

In the first line there is a number T.

T is the test number.

In the next T lines there is a number N.

0≤N≤1018,T≤1000

1
5

2

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<math.h>
using namespace std;
const int N = 5005;
#define LL __int64


int main()
{
   LL n;
   int a[100],T;
   scanf("%d",&T);
   while(T--)
   {
       scanf("%I64d",&n);
       int k=0,flag=0;
       while(n){
            if(n&1){
                if(flag==0)k++; flag=1;
            }
            else flag=0;
            n/=2;
       }
       printf("%d\n",k);
   }
    return 0;
}

HDU 5272 Dylans loves numbers

原文：http://blog.csdn.net/u010372095/article/details/46575783