hdu 3709 Balanced Number 数位DP

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 ≤ 10 18).

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

---

这题就是要求balanced Number（以下简称BN），BN就是说可以在这个数中找到一个数位，使得左右的力矩相同
比如12345选取3作为轴心，则左边的权值是1 * 3 + 2 * 2 + 3 * 1
右边的是5 * 1，我们发现无论如何也不能找到一个位置使得其满足，所以这不是一个BN

数位DP裸，显然我们只需要枚举轴心就可以了，然后去算左右的权值，如果算出来的sum为0的话，显然就是可以的，所以我们dfs的框架也很好搭，也就是那个样子，差不多都要写成模板了，于是直接上代码吧

/*
dp[i][j][k]表示现在的len为i,枚举的中心点为j,现在的枚举的数已经组合和为是sum
*/
#include <bits/stdc++.h>
using namespace std;

long long dp[20][20][2000], l, r;
int a[100];

long long dfs( int len, int pos, int sum, bool frog ) {
    if( len < 0 ) return sum ? 0 : 1;
    if( sum < 0 ) return 0;
    if( !frog && dp[len][pos][sum] != -1 ) return dp[len][pos][sum];
    long long ans = 0;
    int up = frog ? a[len] : 9;
    for( register int i = 0; i <= up; i++ ) ans += dfs( len - 1, pos, sum + ( len - pos ) * i, frog && i == up );
    if( !frog ) dp[len][pos][sum] = ans;
    return ans;
}

long long solve( long long n ) {
    if( n < 0 ) return 0;
    int len = 0;
    while( n ) {
        a[len++] = n % 10;
        n /= 10;
    }
    long long ans = 0;
    for( register int i = 0; i < len; i++ ) ans += dfs( len - 1, i, 0, true );
    return ans - ( len - 1 );
}

int main( ) { int T;
    scanf( "%d", &T );
    memset( dp, -1, sizeof(dp) );
    while( T-- ) { 
        scanf( "%lld%lld", &l, &r );
        printf( "%lld\n", solve(r) - solve( l - 1 ) ); 
    }
    return 0;
}