码迷,mamicode.com
首页 > 其他好文 > 详细

Dylans loves numbers

时间:2016-07-19 23:31:33      阅读:335      评论:0      收藏:0      [点我收藏+]

标签:

Problem 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.
0N1018,T1000
 

 

Output
For each test case,output an answer.
 

 

Sample Input
1 5
 

 

Sample Output
2
 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<cmath>
 5 #include<algorithm>
 6 using namespace std;
 7 int main()
 8 {
 9     __int64 n;int i,j,k,ans,flag,t;
10     while(scanf("%d",&t)!=EOF)
11     {
12         while(t--)
13         {
14             scanf("%I64d",&n);
15             ans=0;flag=1;
16             while(n)
17             {
18                 k=n%2;n/=2;
19                 if(k==1)
20                 {
21                     if(flag==1)
22                     ans++;
23                     flag=0;
24                 }
25                 else
26                 {
27                     flag=1;
28                 }
29             }
30             cout<<ans<<endl;
31         }
32     }
33     return 0;
34 }

 

Dylans loves numbers

标签:

原文地址:http://www.cnblogs.com/WHLdbk/p/5686559.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!