【数位DP】 HDU 3709 Balanced Number

点击打开链接

题意：在一个范围内找出，已某一位为中点两边重量相同的数的个数

例：4139 ：已3为中心 左边 4*2+1*1  =  右边 9*1

思路：固定好中点

 得到的答案再减去 len-1 （重复了0）

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#define cler(arr, val)    memset(arr, val, sizeof(arr))
#define FOR(i,a,b)  for(int i=a;i<=b;i++)
#define IN   freopen ("in.txt" , "r" , stdin);
#define OUT  freopen ("out.txt" , "w" , stdout);
typedef long long  LL;
const int MAXN = 1011;
const int MAXM = 610;
const int INF = 0x3f3f3f3f;
const LL mod = 2147483647;
const double eps= 1e-8;
const double pi=acos(-1.0);
#define lson l,m, rt<<1
#define rson m+1,r,rt<<1|1int len,dig[66];
int len,dig[66];
LL dp[20][20][2000];
LL dfs(int pos,int piv,int sum,int limit)
{
    if(pos<0)
        return sum==0;
    if(!limit&&dp[pos][piv][sum]!=-1)
        return dp[pos][piv][sum];
    LL res=0;
    int last=limit?dig[pos]:9;
    for(int i=0;i<=last;i++)
    {
        res+=dfs(pos-1,piv,(pos-piv)*i+sum,limit&&(i==last));
    }
    if(!limit)
        dp[pos][piv][sum]=res;
    return res;
}
LL solve(LL x)
{
    len=0;
    if(x==0)
        return 1;
    else if(x==-1) return 0;
    while(x)
    {
        dig[len++]=x%10;
        x/=10;
    }
    LL ans=0;
    for(int i=0;i<len;i++)
        ans+=dfs(len-1,i,0,1);
    return ans-len+1;
}
int main()
{
    LL t,x,y;
    cin>>t;
    cler(dp,-1);
    while(t--)
    {
        cin>>x>>y;
        cout<<solve(y)-solve(x-1)<<endl;
    }
    return 0;
}