11361 - Investigating Div-Sum Property

#include <utility>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <set>
#include <vector>
#include <cmath>
#include <queue>
#include <bitset>
#include <map>
#include <iterator>
using namespace std;
#define clr(a,v) memset(a,v,sizeof(a))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int INF = 0x7f7f7f7f;
const int maxn = 211111;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int mod = 777777777;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
int dp[11][84][84][84];
int d[11];
int dfs(int pos,int remain,int sum,int mod,bool doing)
{
	if(pos<0)
		return remain==0&&sum==0;
	if(!doing&&(~dp[pos][remain][sum][mod]))
		return dp[pos][remain][sum][mod];
	int ans=0,end=doing?d[pos]:9;
	for(int i=0;i<=end;++i)
	{
		ans+=dfs(pos-1,(remain*10+i)%mod,(sum+i)%mod,mod,doing&&i==end);
	}
	if(!doing)
		dp[pos][remain][sum][mod]=ans;
	return ans;
}
int cal(int n,int k)
{
	if(k>83)
		return 0;
	int cnt=0;
	while(n)
	{
		d[cnt++]=n%10;
		n/=10;
	}
	return dfs(cnt-1,0,0,k,true);
}

int main() {
	memset(dp,-1,sizeof(dp));
	ios::sync_with_stdio(false);
	int T,a,b,k;
	cin>>T;
	for(int cas=1;cas<=T;++cas)
	{
		cin>>a>>b>>k;
		cout<<cal(b,k)-cal(a-1,k)<<endl;
	}
	return 0;
}