Poj-3252 Round Numbers(数位DP)
来源:互联网 发布:中国社交软件大全 编辑:程序博客网 时间:2024/06/11 18:23
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 ofN 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题意:为你l到r内的所有数中二进制形式0不比1少的数有多少个。分析:数位DP,记录0比1多几个,注意前导零。#include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#include<map>#include<vector>#include<ctime> #include<cstring>#include<stack>#include<cmath>#include<queue>#define INF 0x3f3f3f3f#define eps 1e-9#define MAXN 100000using namespace std;typedef long long ll;int l,r,a[32],dp[32][100];int dfs(int pos,int sta,int lead,int limit){if(pos == -1) return sta >= 0;if(!lead && !limit && dp[pos][sta+30] >= 0) return dp[pos][sta+30];int up = limit? a[pos] : 1;int ans = 0;for(int i = 0;i <= up;i++){ans += dfs(pos-1,sta + ((!i && !lead) ? 1 : (i ? -1 : 0)),lead && !i,limit && i == up);} if(!lead && !limit) dp[pos][sta+30] = ans;return ans;}int solve(int x){int pos = 0;while(x){a[pos++] = x & 1;x >>= 1;}return dfs(pos-1,0,1,1);}int main(){memset(dp,-1,sizeof(dp));scanf("%d%d",&l,&r); printf("%d\n",solve(r)-solve(l-1)); }
- 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)
- POJ 3252 Round Numbers(数位dp)
- POJ 3252 Round Numbers (数位dp)
- 数位DP-POJ-3252-Round Numbers
- 安卓控件之文本框(TextView)
- 51NOD 1270 数组的最大代价
- 欢迎使用CSDN-markdown编辑器
- Pentest - routersploit
- 浪曦生产型ERP课程
- Poj-3252 Round Numbers(数位DP)
- android之数据存储(一)
- yum
- Mysql 多个子查询 多个LEFT JOIN 视图创建
- Net程序员学习Android开发
- android drawable归纳
- MySql数据库的连接和事务处理
- 栈ADT实现
- PHP内核之PHP_FUNCTION宏定义