【数位DP】【SGU 258】. Almost Lucky Numbers

http://acm.sgu.ru/problem.php?contest=0&problem=258

还是不好想

最近找题的技能++。居然找到这么个没题解的题

有个坑点就是——Lucky Numbers不算Almost Lucky Numbers

//#define _TEST _TEST
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
/************************************************
Code By willinglive    Blog:http://willinglive.cf
************************************************/
#define rep(i,l,r) for(int i=l,___t=(r);i<=___t;i++)
#define per(i,r,l) for(int i=r,___t=(l);i>=___t;i--)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define LL long long
#define INE(i,u,e) for(int i=head[u];~i;i=e[i].next)
inline const int read()
{int r=0,k=1;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';return k*r;}
/
const int zero=45;
int dp[15][15][95][10][10];//i位满足条件的数的个数 
int bit[15];
/
int dfs(int pos,int digit,int dif,int c1,int c2,bool limit)
{
	if(!pos) return dif!=zero&&dif-c1<=zero&&dif+c2>=zero;
	int tmp=dp[pos][digit][dif][c1][c2];
	if(!limit&&~tmp) return tmp;
	int low=digit==pos;
	int upp=limit?bit[pos]:9;
	int ans=0;
	rep(i,low,upp)
	{
		int new_c1,new_c2;
		if(pos>digit/2)
		{
			new_c1=max(c1,i-low);
			new_c2=max(c2,9-i);
		}
		else
		{
			new_c1=max(c1,9-i);
			new_c2=max(c2,i);
		}
		ans+=dfs(pos-1,digit,dif+(pos>digit/2?i:-i),new_c1,new_c2,limit&&i==upp);
	}
	if(!limit) dp[pos][digit][dif][c1][c2]=ans;
	return ans;
}
int cal(int n)
{
	for(*bit=0;n;n/=10) bit[++*bit]=n%10;
    int ans=0;
    for(int i=2;i<=*bit;i+=2)
        ans+=dfs(i,i,zero,0,0,i==*bit);
    return ans;
}
/
void solve()
{
	MS(dp,-1);
    int l,r;
    l=read(),r=read();
    printf("%d\n",cal(r)-cal(l-1));
}
/
int main()
{
    #ifndef _TEST
    freopen("std.in","r",stdin); freopen("std.out","w",stdout);
    #endif
    solve();
    return 0;
}