poj 3252 Round Number 数位dp
来源:互联网 发布:带鱼孩子刷爆网络 编辑:程序博客网 时间:2024/05/23 12:17
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
Output
Sample Input
2 12
Sample Output
6
Source
[Submit] [Go Back] [Status] [Discuss]
Home Page Go Back To top
转化成二进制然后按位dp统计0和1的个数
注意判断是否是前导0
ACcode:
#include <cstdio>#include <iostream>#include <cstring>using namespace std;int dp[40][40][40];int a,b;int data[40];int dfs(int len,int is_0,int is_1,int pre,int limit){ if(!len)return is_0>=is_1; if(!pre&&!limit&&dp[len][is_0][is_1]!=-1)return dp[len][is_0][is_1]; int ed=limit?data[len]:1; int ans=0; for(int i=0;i<=ed;++i){ if(pre){ if(i==0)ans+=dfs(len-1,0,0,1,limit&&i==ed); else ans+=dfs(len-1,is_0,is_1+1,0,limit&&i==ed); } else { if(i==0)ans+=dfs(len-1,is_0+1,is_1,0,limit&&i==ed); else ans+=dfs(len-1,is_0,is_1+1,0,limit&&i==ed); } } if(!limit&&!pre)dp[len][is_0][is_1]=ans; return ans;}int fun(int a){ int len=0; while(a){ data[++len]=a%2; a>>=1; } return dfs(len,0,0,1,1);}void doit(){ printf("%d\n",fun(b)-fun(a-1));}int main(){ memset(dp,-1,sizeof(dp)); while(~scanf("%d%d",&a,&b))doit(); return 0;}
- poj 3252 数位dp(Round Number)
- poj 3252 Round Number 数位dp
- Round Number --数位DP
- POJ 3252 Round Numbers 数位DP
- poj 3252 Round Numbers (数位DP)
- poj 3252 Round Numbers(数位dp)
- POJ 3252 Round Numbers (数位DP)
- poj 3252 Round Numbers(数位dp)
- Round Numbers - POJ 3252 数位dp
- 【数位DP】【poj 3252】Round Numbers
- poj 3252 Round Numbers 数位dp
- POJ 3252 Round Numbers (数位DP)
- POJ 3252 round numbers(数位DP)
- 【数位DP】POJ 3252 Round Numbers
- POJ 3252 Round Numbers 数位dp(入门
- poj 3252 Round Numbers(数位dp)
- POJ 3252 Round Numbers(数位DP)
- POJ 3252 Round Numbers (简单数位DP)
- ListView的setOnClickListener失效
- 数位dp
- 使用python将KDD-99中的文本替换为数值形式
- ImageView你不知道的一些问题
- Java 里http协议的get请求
- poj 3252 Round Number 数位dp
- springMVC详解
- 剖析大数据之Hadoop简介
- vtreat cross frames
- 输出一个整数val的每一位
- 手把手教你使用Git
- 每天laravel-20160801| Container -4
- 资料
- 对象的比较与排序:IComparable和IComparer接口