POJ 3252Round Numbers(数位dp)
来源:互联网 发布:最好的java培训机构 编辑:程序博客网 时间:2024/06/05 12:50
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
#include<string.h>
int a[35];
int dp[35][55];
int dfs(int pos,int sum,bool lead,bool limit)
{
if(pos<0)
return sum>=32;
if(!limit &&!lead&& dp[pos][sum] != -1)
return dp[pos][sum];
int up = limit ? a[pos] : 1;
int tmp = 0;
for(int i = 0; i <= up; i++)
{
if(lead&&i==0)
tmp += dfs(pos-1,sum,lead,limit&&(i==a[pos]));
else
tmp += dfs(pos-1,sum+(i==0?1:-1),lead&&i==0,limit&&(i==a[pos]));
}
if(!limit&&!lead)
dp[pos][sum] = tmp;
return tmp;
}
int solver(int x)
{
int pos=0;
while(x)
{
a[pos++]=x&1;
x>>=1;
}
return dfs(pos-1,32,1,1);
}
int main()
{
int n,m;
memset(dp,-1,sizeof(dp));
while(~scanf("%d%d",&n,&m))
{
printf("%d\n",solver(m)-solver(n-1));
}
return 0;
}
- 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)
- 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 3252Round Numbers(数位DP)
- POJ 3252 Round Numbers(数位dp)
- poj 3252 Round Numbers(数位dp)
- poj 3252 Round Numbers(数位DP)
- POJ 3252Round Numbers(数位dp)
- POJ 3252 Round Numbers (数位dp)
- POJ 3252 Round Numbers(数位DP)
- [LeetCode]122. Best Time to Buy and Sell Stock II
- luogu P1525 关押罪犯
- HDU 1542 Atlantis(矩形面积并,线段树+离散化+线扫描)
- 1015. 德才论 (vector + sort 排序)
- LDA 与 PLSA对比
- POJ 3252Round Numbers(数位dp)
- 迷宫最小步数
- 微信本地调试神器==Charles入门案例
- iOS自动化测试之一体化平台搭建过程中需要学习的部分知识
- Unity3D开发之自绘地形图
- Mybatis传多个参数
- Volatile、AtomicInteger、java并发
- Android游戏开发之飞行射击类游戏原理
- 排序算法