HDU 5272 Dylans loves numbers
来源:互联网 发布:mac怎么安装anaconda 编辑:程序博客网 时间:2024/05/18 09:11
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.
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 .
In the next
Output
For each test case,output an answer.
Sample Input
15
题意: 一个数的二进制表示下,被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;}
0 0
- HDU 5272 Dylans loves numbers
- HDU 5272Dylans loves numbers
- HDU 5272 Dylans loves numbers
- hdu 5272 Dylans loves numbers
- HDU 5272 Dylans loves numbers
- HDU 5272 : Dylans loves numbers
- HDU 5272 Dylans loves numbers
- HDU - 5272 Dylans loves numbers
- HDU 5272 Dylans loves numbers 二进制
- 文章标题 HDU 5272:Dylans loves numbers( 水)
- Dylans loves numbers
- HDU 5272 Dylans loves numbers——BestCoder Round #45(模拟)
- hdu 5273 Dylans loves sequence
- HDU 5273Dylans loves sequence
- hdu 5273 Dylans loves sequence
- HDU 5273 Dylans loves sequence
- HDU 5273 Dylans loves sequence
- HDU 5273 Dylans loves sequence(区间DP)
- 插入DocumentFragment与直接插入节点的区别
- Android官方文档之App Components(Loaders)
- 最大流 二分图
- git---gui使用
- typedef struct 和 struct 的区别
- HDU 5272 Dylans loves numbers
- listviewd的OnScrollListener监听事件
- count_if 和count
- ACM第三次练习—1010
- 第三届河南省程序设计大赛-NYOJ-250-ROOM ASSIGNATION
- ToolBar简介
- java 完全解耦和弱耦合
- Mybatis入门程序
- Check whether userfaultfd is available