hdu4734（数位DP）

最新推荐文章于 2022-09-16 16:06:28 发布

原创最新推荐文章于 2022-09-16 16:06:28 发布 · 854 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

数位DP

本博客介绍了一个计算给定范围内数字的加权和的过程，其中加权和是基于数字位数及其对应的权重计算得出。通过动态规划方法解决此问题，并提供了详细解释和示例输入输出。

F(x)

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

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

题意：RT

思路：dp[i][j]表示从最低位到第i位取得的总和 <= j 的方案数，当然在递归的过程中还要判断是否为边界，为边界就不能记忆化了，所以不为边界的时候就可以记录dp值

#include 
#include 
#include 
#include 
#include 
using namespace std;

int total;
int dp[12][5000];
int a[12];
int dit[12];

int dfs(int p,int v,int vis)
{
    int i;
    if(p==9)return 1;
    if(!vis&&dp[p][v])return dp[p][v];

    int temp,ans=0;
    int maxi= vis? a[p]:9;
    for(i=0;i<=maxi;i++)if((temp = dit[p]*i) <= v )ans+=dfs( p+1 , v - temp , vis && (i==maxi) );
    else break;
    
    if(!vis)dp[p][v]=ans;
    return ans;
}

int main()
{
    int t,A,B,tt=0,i;
    
    scanf("%d",&t);
    
    for(i=0;i<9;i++)dit[i]=1<<(8-i);
    
    memset(dp,0,sizeof(dp));

    while(t--)
    {

        scanf("%d%d",&A,&B);
        int j,x;
        total=0;
        i=0;
        while(A)
        {
            x=A%10;
            A/=10;
            total+=x*(1<

标签

#ACM #hdu