Balanced Number
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 5386 Accepted Submission(s): 2576
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
Author
GAO, Yuan
【分析】
神题一道,神奇记忆化搜索,不按套路出牌的数位dp
【代码】
#include<iostream>
#include<cstring>
#include<cstdio>
#define ll long long
#define M(a) memset(a,0,sizeof a)
#define fo(i,j,k) for(int i=j;i<=k;i++)
using namespace std;
const int mxn=100005;
ll a,b,T;
ll digit[20],dp[20][20][2005];
inline ll dfs(int pos,int o,int l,bool f)
{
if(pos==0) return l==0?1:0;
if(l<0) return 0; //力矩和剪枝
if(!f && dp[pos][o][l]!=-1)
return dp[pos][o][l]; //记忆化
ll ans=0;
int end=f?digit[pos]:9;
fo(i,0,end)
{
int next=l+(pos-o)*i;
ans+=dfs(pos-1,o,next,f&&(i==end));
}
if(!f) dp[pos][o][l]=ans;
return ans;
}
inline ll work(ll n)
{
memset(dp,-1,sizeof dp);
int len=0;
while(n)
{
digit[++len]=n%10;
n/=10;
}
ll ans=0;
fo(i,1,len)
ans+=dfs(len,i,0,1);
return ans-(len-1);
}
int main()
{
int i,j;
scanf("%lld",&T);
while(T--)
{
scanf("%lld%lld",&a,&b);
printf("%lld\n",work(b)-work(a-1));
}
return 0;
}
//1
//7604 24324