Hello Codeforces,

I have seen multiple blogs on iterative digit dp. In this blog, I would like to share my recursive implementation of digit dp related problems.

Problem Structure

Typically, digit dp is used in problems of finding the number of values in a range $$$[l,r]$$$ which follow a certain property. Let us call this $$$f(l,r)$$$. The following method will work only when $$$f(l,r) = f(0,r) - f(0,l-1)$$$, which is true for most of the problems. We will now focus on how to calculate $$$g(n) = f(0,n)$$$.

Idea behind the algorithm

To count all numbers less than or equal to $$$n$$$ which follow a certain property, we first count all numbers with the same number of digits as $$$n$$$. Here the numerical order will be the same as lexicographical order. We can now iterate over the common prefix of the two numbers and the first character which differs after the prefix. This gives us the following template.

int g(string s){
	int n = s.size();
	
	int ans = 0;
	for(int i = 0; i < n; i++){ // i is the first position of difference

		for(int j = (i == 0); j < s[i] - '0'; j++){ // keeping digit j at position i

			ans += valid_strings(n-i-1); // number of valid strings of length n-i-1

		}
	}
	
	if(valid(s)){
		ans += 1;
	}
	
	if(n > 1){ // All numbers with less digits
		ans += g(string(n-1,'9'));
	}
	
	return ans;
}

Some remarks are as follows.

• Adding memoisation to this recursive function gives polylog complexity in most cases.
• $$$j$$$ is initialised to $$$1$$$ for $$$i == 0$$$ since our numbers can't have leading zeroes.
• $$$\text{valid_strings}(\cdots)$$$ may be a dp table instead of a mathematical function. It might also depend on the prefix as well as the leftover length.

Some examples

Consider CSES Counting Numbers. Here we have to find the number of numbers less than or equal to $$$n$$$ that no two consecutive digits are the same. Here I get the following function. Full solution.

map<string,int> mp;
int g(string s){
	if(mp.find(s) != mp.end()){
		return mp[s];
	}
	
	int n = s.size();
	int &ans = mp[s];
	
	bool ok = true;
	
	for(int i = 0; i < n; i++){
		
		for(int j = (i == 0); j < s[i] - '0'; j++){
			if(i == 0 || s[i-1] != j + '0'){
			       ans += power(9,n-i-1);
                        }
		}
		
		if(i != 0 && s[i] == s[i-1]){
			ok = false;
			break;
		}
	}
	
	ans += ok;
	
	if(n > 1){
		ans += get(string(n-1,'9'));
	}
	
	return ans;
}

CF 919B is an example where a dp table is needed to implement the $$$\text{valid_strings}(\cdots)$$$ function. There is a preparatory phase for filling the dp table. The relevant functions are provided below. Full solution.

const int N = 40;
int dp[N+5][10*N + 5]; // dp[i][j] = number of numbers of i digits with sum == j

void prep(){
	memset(dp,0,sizeof(dp));
	dp[0][0] = 1;
	
	for(int i = 1; i < N; i++){
		for(int j = 0; j < 10; j++){
			for(int s = j;s < 10*N;s++){
				dp[i][s] += dp[i-1][s-j];
			}
		}
	}
}


map<string,int> mp;
int g(string s){
	
	if(mp.find(s) != mp.end()){
		return mp[s];
	}
	
	int n = s.size();
	
	int &ans = mp[s];
	
	int sum = 0;
	
	for(int i = 0; i < n; i++){
		
		for(int j = (i == 0); j < s[i] - '0'; j++){
			int targ = 10 - (sum + j);
			if(targ >= 0){
				ans += dp[n-i-1][targ];
			}
		}
		sum += s[i] - '0';
	}
	
	ans += sum == 10;
	
	if(n > 1){
		ans += get(string(n-1,'9'));
	}
	
	return ans;
}