hdu 5272 Dylans loves numbers

题目连接

http://acm.hdu.edu.cn/showproblem.php?pid=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 $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.

Input

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 \leq N \leq 10^{18},T \leq 1000$

Output

For each test case,output an answer.

SampleInput

1

5

SampleOutput

2

 #include<algorithm>
 #include<iostream>
 #include<cstdlib>
 #include<cstring>
 #include<cstdio>
 #include<vector>
 #include<map>
 #include<set>
 using std::cin;
 using std::cout;
 using std::endl;
 using std::find;
 using std::sort;
 using std::set;
 using std::map;
 using std::pair;
 using std::vector;
 #define sz(c) (int)(c).size()
 #define all(c) (c).begin(), (c).end()
 #define iter(c) __typeof((c).begin())
 #define cls(arr,val) memset(arr,val,sizeof(arr))
 #define cpresent(c, e) (find(all(c), (e)) != (c).end())
 #define rep(i, n) for (int i = 0; i < (int)(n); i++)
 #define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
 #define pb(e) push_back(e)
 #define mp(a, b) make_pair(a, b)
 const int Max_N = ;
 typedef unsigned long long ull;
 int main() {
 #ifdef LOCAL
     freopen("in.txt","r",stdin);
     freopen("out.txt","w+",stdout);
 #endif
     int t;
     ull ret;
     scanf("%d",&t);
     while(t--) {
         int f = , ans = ;;
         scanf("%lld",&ret);
         while(ret) {
             if(f) {
                 if(ret & ) ans++, f = ;
             } else if(!(ret & )) f = ;
             ret >>= ;
         }
         printf("%d\n",ans);
     }
     return ;
 }