HDU 5272 Dylans loves numbers

Description

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  . 
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.

 

Input

In the first line there is a number  . 

 is the test number. 

In the next   lines there is a number  . 

 

Output

For each test case,output an answer.

 

Sample Input

    
    

     
     1
5 
    
    

题意: 一个数的二进制表示下,被0分割开的1有多少组 (如10100111 三组)

#include <iostream>
#include <string>
#include <map>
#include <stdio.h>
#include <algorithm>
using namespace std;


int main()
{
    int T,c;
    __int64 N;
    scanf("%d",&T);
    for(int i=0; i<T; i++)
    {
        __int64 num=0;
        c=0;
        scanf("%I64d",&N);
        int n=0;
        while(N)
        {
            if(c==0&&(N&1))
            {
                num++;
                c=1;
            }
            if((N&1)==0)
            {
                c=0;
            }
            N=N/2;
        }
        printf("%I64d\n",num);
    }
    return 0;
}