poj_3252数位dp

组合数学

c(n, r) = c(n, n - r); c(5, 3) = c(5, 2);
c(n+1, m) = c(n, m) + c(n, m - 1); c(7, 3) = c(6, 3) + c(6, 2);
c(n, n - k) = c(n - 1, k) + c(n - 1, k - 1); c(10, 10 - 6) = c(9, 6) + c(9, 5);

#include<iostream>
#include<cstring>
//组合数学
/*
c(n, r) = c(n, n - r); c(5, 3) = c(5, 2);
c(n+1, m) = c(n, m) + c(n, m - 1); c(7, 3) = c(6, 3) + c(6, 2); 打表
c(n, n - k) = c(n - 1, k) + c(n - 1, k - 1); c(10, 10 - 6) = c(9, 6) + c(9, 5); 
*/
using namespace std;
int c[50][50] = {0}, bit[50];
//打表
void init(){
    for(int i = 0; i <= 33; i++){
        for(int j = 0; j <= i; j++){
            if(!j || i == j){
                c[i][j] = 1;
            }else{
                c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
            }
        }
    }
}
void erjinzhi_fenjie(int number){//bit[0] 表示 数位长度;
    bit[0] = 0;
    while(number){
        bit[0]++;
        bit[bit[0]] = number % 2;
        number /= 2;
    }
}

int solve(int n){
    int sum = 0;
    erjinzhi_fenjie(n);
    //计算长度小于bit[0]的数
    for(int i = 1; i <= bit[0] - 2; i++){//比如一个分解后8位的
        for(int j = i / 2 + 1; j <= i; j++){
            sum += c[i][j];
        }
    }
    //长度等于bit[0]的,我们需要[len/2+1, len]个0; 
    int zero = 0;
    int need = (bit[0] + 1) / 2;
    for(int i = bit[0] - 1; i >= 1; i--){
        if(bit[i]){//当前二进制数位为1,把当前位填0
            for(int j = (need - zero - 1); j <= i - 1; j++){
                sum += c[i - 1][j];
            }
        }else{
            zero ++;
        }
    }
    return sum;
} 
int main(){
    int sta, end;
    init();
  //  cin >> sta >> end;
    while(cin >> sta >> end){
        cout << solve(end + 1) -solve(sta) << endl; 
    }
    return 0;
}