hdu3709 Balanced Number 树形dp

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].

InputThe 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 ≤ 10 ¹⁸).OutputFor 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

题意：一个数，定一个支点，力矩相等为平衡数。
题解：数位dp，f[i][j][k]表示i为，j位为支点，k为当前力矩。

 #include<cstring>
 #include<cmath>
 #include<algorithm>
 #include<iostream>
 #include<cstdio>
 #define ll long long
 using namespace std;

 ll f[][][],l,r;
 int a[],n,cnt;

 ll dfs(int wei,int zd,int lj,bool flag)
 {
     if (wei==) return lj==;
     if (lj<) return ;
     if (!flag&&f[wei][zd][lj]!=-) return f[wei][zd][lj];
     ll res=;
     int ed;
     if (flag) ed=a[wei];
     else ed=;
     for (int i=;i<=ed;i++)
         res+=dfs(wei-,zd,lj+(wei-zd)*i,flag&&i==ed);
     if (!flag) f[wei][zd][lj]=res;
     return res;
 }
 ll solve(ll x)
 {
     cnt=;
     while(x)
     {
         a[++cnt]=x%;
         x/=;
     }
     ll ans=;
     for (int i=;i<=cnt;i++)
         ans+=dfs(cnt,i,,);
     return ans-(cnt-);
 }
 int main()
 {
     int cas;scanf("%d",&cas);
     memset(f,-,sizeof(f));
     while(cas--)
     {
         scanf("%lld%lld",&l,&r);
         printf("%lld\n",solve(r)-solve(l-));
     }
 }