| Online Judge | Online Exercise | Online Teaching | Online Contests | Exercise Author |
|
F.A.Q Hand In Hand Online Acmers |
Best Coder beta VIP | STD Contests DIY | Web-DIY beta |
Dylans loves numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1463 Accepted Submission(s): 705
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.
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$
$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.
Sample Input
1 5
Sample Output
2
Source
| Home | Top |
Hangzhou Dianzi University Online Judge 3.0 Copyright © 2005-2024 HDU ACM Team. All Rights Reserved. Designer & Developer : Wang Rongtao LinLe GaoJie GanLu Total 0.000000(s) query 1, Server time : 2024-11-22 12:10:52, Gzip enabled |
Administration |