zoukankan      html  css  js  c++  java
  • poj 3252 Round Numbers(数位DP)

     
                                      Round Numbers
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 11003   Accepted: 4064

    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

    Source

     
     
    思路
      数位DP。
      组合计数的方法好麻烦,蒟蒻看不懂 =-=
     
    代码
     
     1 #include<cstdio>
     2 using namespace std;
     3 
     4 const int N = 50;
     5 
     6 int f[N][N][N],b[N],len;
     7 
     8 //p n0 n1 // flag 表示前面的位是否枚举完  z 标记前缀是否为0 
     9 int dp(int p,int n0,int n1,int flag,int z) {
    10     if(!p) return n0>=n1;
    11     if(!flag && f[p][n0][n1])
    12         return f[p][n0][n1];
    13     int ans=0;
    14     int end=flag? b[p]:1;
    15     for(int i=0;i<=end;i++)
    16         ans += dp(p-1,(z&&i==0)?0:n0+(i==0),(z&&i==0)?0:n1+(i==1),flag&&i==end,z&&(i==0));
    17     if(!flag) f[p][n0][n1]=ans;
    18     return ans;
    19 }
    20 
    21 int Fc(int n) {
    22     len=0;
    23     while(n)
    24         b[++len]=n&1 , n>>=1;
    25     return dp(len,0,0,1,1);
    26 }
    27 
    28 int main() {
    29     int n,m;
    30     scanf("%d%d",&n,&m);
    31     printf("%d",Fc(m)-Fc(n-1));
    32     return 0;
    33 }
     
  • 相关阅读:
    组合总和
    子集Ⅱ
    子集
    全排列Ⅱ
    全排列
    填充下一个结点下一个Next结点
    把二叉树转化成累加树
    二叉树的左叶子之和
    高速C/C++编译工具ccache
    【转载】如何用U盘制作Ubuntu启动盘
  • 原文地址:https://www.cnblogs.com/lidaxin/p/5125535.html
Copyright © 2011-2022 走看看