HDU 4507(数位dp)

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
#define MOD 1000000007
#define ll __int64

struct node
{
	ll cnt,sum,powsum;//个数，和，平方的和
}dp[25][7][7];
ll digit[25];
ll p[25];

node dfs(ll len,ll sum,ll num,bool limit)
{
	node ret;
	ret.cnt=ret.sum=ret.powsum=0;
	if(!len)
	{
		if(sum==0||num==0)ret.cnt=0;
		else ret.cnt=1;
		return ret;
	}
	if(!limit&&dp[len][sum][num].cnt!=-1)return dp[len][sum][num];
	ll maxi,i;
	maxi=limit?digit[len]:9;
	for(i=0;i<=maxi;i++)
	{
		if(i==7)continue;
		node now=dfs(len-1,(sum+i)%7,(num*10+i)%7,limit&&(i==maxi));
		ret.cnt=(ret.cnt+now.cnt)%MOD;
		ret.sum=(ret.sum+(i*p[len]*now.cnt)%MOD+now.sum)%MOD;
		ret.powsum=(ret.powsum+((i*i*p[len])%MOD*p[len])%MOD*now.cnt+2*i*((p[len]*now.sum)%MOD)+now.powsum)%MOD;
	}
	if(!limit)dp[len][sum][num]=ret;
	return ret;
}

ll solve(ll n)
{
	ll len=0;
	while(n)
	{
		digit[++len]=n%10;
		n/=10;
	}
	digit[len+1]=0;
	return dfs(len,0,0,true).powsum;
}

int main()
{
	memset(dp,-1,sizeof dp);
	ll i;
	p[1]=1;
	for(i=2;i<=20;i++)p[i]=(p[i-1]*10)%MOD;
	int t;
	scanf("%d",&t);
	while(t--)
	{
		ll l,r;
		scanf("%I64d%I64d",&l,&r);
		printf("%I64d\n",(solve(r)-solve(l-1)+MOD)%MOD);
	}
	return 0;
}