【1】【数位DP】HDU3709 Balanced Number

最新推荐文章于 2021-01-13 22:23:33 发布

Millie3e

最新推荐文章于 2021-01-13 22:23:33 发布

阅读量208

点赞数

分类专栏：动态规划文章标签：数位DP

本文链接：https://blog.csdn.net/sinat_35003880/article/details/52052716

版权

动态规划专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Balanced Number

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 4248 Accepted Submission(s): 1997

Problem Description
A balanced number is a non-negative integer that can be balanced if a pivot is placed at some digit. More specifically, imagine each digit as a box with weight indicated by the digit. When a pivot is placed at some digit of the number, the distance from a digit to the pivot is the offset between it and the pivot. Then the torques of left part and right part can be calculated. It is balanced if they are the same. A balanced number must be balanced with the pivot at some of its digits. For example, 4139 is a balanced number with pivot fixed at 3. The torqueses are 4*2 + 1*1 = 9 and 9*1 = 9, for left part and right part, respectively. It’s your job
to calculate the number of balanced numbers in a given range [x, y].

Input
The input contains multiple test cases. The first line is the total number of cases T (0 < T ≤ 30). For each case, there are two integers separated by a space in a line, x and y. (0 ≤ x ≤ y ≤ 1018).

Output
For each case, print the number of balanced numbers in the range [x, y] in a line.

Sample Input
2
0 9
7604 24324

Sample Output
10
897

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
__int64 dp[20][20][2000+5],bit[20];

__int64 dfs(int pos,int o,int pre,int limit)
{
    if(pos==0)return pre==0;
    if(pre<0)return 0;
    if(!limit&&dp[pos][o][pre]!=-1)return dp[pos][o][pre];
    int end=limit?bit[pos]:9;
    __int64 ans=0;
    for(int i=0;i<=end;i++)
    {
        int ne=pre;
        ne+=(pos-o)*i;
        ans+=dfs(pos-1,o,ne,limit&&i==end);
    }
    if(!limit)dp[pos][o][pre]=ans;
    return ans;
}

__int64 solve(__int64 x)
{
    memset(bit,0,sizeof(bit));
    memset(dp,-1,sizeof(dp));
    int len=0;
    __int64 ans=0;
    while(x){
        bit[++len]=x%10;
        x/=10;
    }
    for(int i=1;i<=len;i++){
        ans+=dfs(len,i,0,1);
    }
    return ans-(len-1);
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--){
        __int64 x,y;
        scanf("%I64d%I64d",&x,&y);
        printf("%I64d\n",solve(y)-solve(x-1));
    }
    return 0;
}