hdu4734（数位DP）

最新推荐文章于 2017-10-16 10:52:40 发布

ten_three

最新推荐文章于 2017-10-16 10:52:40 发布

阅读量705

点赞数

分类专栏：数位DP 文章标签： hdu 数位DP

本文链接：https://blog.csdn.net/ten_three/article/details/20953307

版权

数位DP 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

地址：http://acm.hdu.edu.cn/showproblem.php?pid=4734

F(x)

Time Limit: 1000/500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1095 Accepted Submission(s): 443

Problem Description

For a decimal number x with n digits (A _nA _n-1A _n-2 ... A ₂A ₁), we define its weight as F(x) = A _n * 2 ^n-1 + A _n-1 * 2 ^n-2 + ... + A ₂ * 2 + A ₁ * 1. Now you are given two numbers A and B, please calculate how many numbers are there between 0 and B, inclusive, whose weight is no more than F(A).

Input

The first line has a number T (T <= 10000) , indicating the number of test cases.
For each test case, there are two numbers A and B (0 <= A,B < 10 ⁹)

Output

For every case,you should output "Case #t: " at first, without quotes. The t is the case number starting from 1. Then output the answer.

Sample Input

Sample Output

  
  
   
   Case #1: 1
Case #2: 2
Case #3: 13

水题，注意一下时间就行了。

代码：

#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
#define LL __int64
#define Max 200010
int num[15],dp[15][4700],top;
int dfs(int len,int n,bool p){
    if(n<0) return 0;
    if(!len) return n>=0;
    if(!p&&~dp[len][n]) return dp[len][n];
    int u=p?num[len]:9;
    int ans=0,k=1<<(len-1);
    for(int i=0;i<=u;i++)
        ans+=dfs(len-1,n-i*k,i==u&p);
    if(!p) dp[len][n]=ans;
    return ans;
}
int getans(int l,int r){
    top=0;
    for(int i=1;l;i*=2,l/=10)
        top+=((l%10)*i);
    int len=0;
    for(;r;r/=10)
        num[++len]=r%10;
    return dfs(len,top,1);
}
int main(){
    int t,cas=1;
    memset(dp,-1,sizeof(dp));
    scanf("%d",&t);
    while(t--){
        int l,r;
        scanf("%d%d",&l,&r);
        printf("Case #%d: %d\n",cas++,getans(l,r));
    }
    return 0;
}