PoJ 3252 Round Numbers 数位DP

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

---

题目描述：

这题是要求a到b里有多少round number（一下简称RN），RN就是二进制表示中0的个数大于等于1的个数的数

---

题解：

要求RN，显然第一种方法是求小于一个数的数中有多少数满足，这里我们用组合数来求，比如现在在dfs的时候，现在的0和1的个数差值是0，还剩五个位置，现在可以随意填，那么我们就有C（5，3） + C（5，4）+C（5，5）
这是很显然的一种解法，这里说一种另外的解法

现在我们用sta来表示0的个数减去1的个数+32之后的这个数，为什么要+32呢，因为如果先前的0比1少，但是后来如果0比较多的话，仍然可能让他是一个round number，这样+32只是为了方便记忆化，毕竟数组下标不能为负数，这对于我来说是新操作233，%%%

然后我们传一个

int dfs( int pos, int sta, bool lead, bool limit ) 

其中sta的含义已经表示，pos表示当前讨论的是哪一位，从小到大，lead表示是否求前导零，limit表示是否有限制

int dfs( int pos, int sta, bool lead, bool limit ) {
    if( pos == -1 ) return sta >= 32;
    if( !limit && !lead ) return dp[pos][sta];
    int up = limit ? a[pos] : 1;
    int ans = 0;
    for( register int i = 0; i <= up; i++ ) {
        if( lead && i == 0 ) ans += dfs( pos - 1, sta, lead, limit && i == up );
        else                 ans += dfs( pos - 1, sta + ( i == 0 ? 1 : -1 ), lead && i == 0, limit && i == up );
    }
    if( !limit && !lead ) dp[pos][sta] = ans;
    return ans;
}

---

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int dp[66][66], a[66]; 
int dfs( int pos, int sta, bool lead, bool limit ) { // sta表示0的个数减去1的个数 +32 
    if( pos == -1 ) return sta >= 32;
    if( !limit && !lead && dp[pos][sta] != -1 ) return dp[pos][sta];
    int up = limit ? a[pos] : 1;
    int ans = 0;
    for( register int i = 0; i <= up; i++ ) {
        if( lead && i == 0 ) ans += dfs( pos - 1, sta, lead, limit && i == up );
        else                 ans += dfs( pos - 1, sta + ( i == 0 ? 1 : -1 ), lead && i == 0, limit && i == up );         
    }
    if( !limit && !lead ) dp[pos][sta] = ans;
    return ans;
}

int solve( int n ) {
    int len = 0;
    while( n ) {
        a[len++] = n & 1;
        n >>= 1; 
    }
    return dfs( len - 1, 32, true, true );
} 

int main( ) { int a, b; memset( dp, -1, sizeof(dp) );   
    while( ~scanf( "%d%d", &a, &b ) ) 
        printf( "%d\n", solve( b ) - solve( a - 1 ) );
    return 0;
}