3252. Round Numbers
来源:互联网 发布:linux mysql 停止 编辑:程序博客网 时间:2024/06/04 00:40
Description
The cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone’ (also known as ‘Rock, Paper, Scissors’, ‘Ro, Sham, Bo’, and a host of other names) in order to make arbitrary decisions such as who gets to be milked first. They can’t even flip a coin because it’s so hard to toss using hooves.
They have thus resorted to “round number” matching. The first cow picks an integer less than two billion. The second cow does the same. If the numbers are both “round numbers”, the first cow wins,
otherwise the second cow wins.
A positive integer N is said to be a “round number” if the binary representation of N has as many or more zeroes than it has ones. For example, the integer 9, when written in binary form, is 1001. 1001 has two zeroes and two ones; thus, 9 is a round number. The integer 26 is 11010 in binary; since it has two zeroes and three ones, it is not a round number.
Obviously, it takes cows a while to convert numbers to binary, so the winner takes a while to determine. Bessie wants to cheat and thinks she can do that if she knows how many “round numbers” are in a given range.
Help her by writing a program that tells how many round numbers appear in the inclusive range given by the input (1 ≤ Start < Finish ≤ 2,000,000,000).
Input
Line 1: Two space-separated integers, respectively Start and Finish.
Output
Line 1: A single integer that is the count of round numbers in the inclusive range Start..Finish
Sample Input
2 12
Sample Output
6
思路
http://user.qzone.qq.com/289065406/blog/1301472836
讲得很棒!
不过bin[32]也可以AC哦!
代码
#include <iostream>#include <algorithm>using namespace std;int bin[32] = { 0 };int c[32][32];void init(){ for (int i = 0; i < 32; i++) { c[i][0] = c[i][i] = 1; for (int j = 1; j < i; j++) c[i][j] = c[i - 1][j] + c[i - 1][j - 1]; } }int count(int a) // 小于a的RN数{ int sum = 0; //比a小的RN数 int len = 0; while (a) { bin[++len] = a % 2; a /= 2; } /*长度小于len的RN数的个数*/ for (int i = 1; i < len; i++) for (int j = (i+1) / 2; j < i; j++) sum += c[i-1][j]; /*长度等于len的RN数的个数*/ int zero = 0; for (int i = len - 1;i > 0; i--) { if (bin[i]) { zero++; for (int j = max(0, (len + 1) / 2 - zero); j < i; j++) sum += c[i - 1][j]; zero--; } else zero++; } return sum;}int main(){ int a, b; cin >> a >> b; init(); cout << count(b+1)-count(a) << endl; return 0;}
- 3252. Round Numbers
- POJ 3252.Round Numbers
- Round Numbers
- Round Numbers
- Round Numbers
- Round Numbers
- POJ3252 Round Numbers
- poj 3252--Round Numbers
- poj 3252 Round Numbers
- poj 3252 Round Numbers
- POJ 3252 Round Numbers
- POJ 3252 Round Numbers
- poj 3252 Round Numbers
- poj-3252-Round Numbers
- 【打表】Round Numbers
- POJ 3252 Round Numbers
- POJ 3252 Round Numbers
- POJ 3252 Round Numbers
- LeetCode
- 神经网络中权值初始化的方法
- ubuntu16.04下安装phpmyadmin
- css实现div层透明毛玻璃
- CSDN日报20170727——《想提高团队技术,来试试这个套路!》
- 3252. Round Numbers
- 合并游戏 737(区间Dp
- shell中curl 用法详解 (二)
- 2017多校训练赛第二场 HDU 6053 TrickGCD(容斥原理/莫比乌斯反演)
- bootstrapTable的使用
- sklearn错误解决:ValueError: Class label 0 not present
- C/C++ | 23-12 用指针的方法,将字符串“ABCD1234efgh”前后对调显示
- 关于easyUI datagrid、layout动态改变大小使用的方法
- 常见OJ评判结果对照表,作为ACMer你懂得!