CodeForces 1036C :Classy Numbers 数位DP

传送门

题意

分析

看题面大概就知道这是个数位$DP$了，所以也大大降低了这道题的难度
我们从高位开始$dfs$每一位，记忆化搜索，记录$f[i][j]$表示第$i$位出现了$j$个数字

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 25;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int a[N];
ll f[N][10];

ll dfs(int num,bool st,int cnt){
	if(cnt > 3) return 0;
	if(!num) return 1;
	if(!st && f[num][cnt]) return f[num][cnt];
	ll ans = 0;
    int ed = st ? a[num] : 9;
    for(int i = 0;i <= ed;i++)
    	ans += dfs(num - 1,st && (i == ed),cnt + (i != 0));
   	if(!st)f[num][cnt] = ans;
   	return ans;
}

ll solve(ll x){
	memset(f,0,sizeof f);
	int num = 0;
    while(x){
        a[++num] = x % 10;
        x /= 10; 
    }
    return dfs(num,1,0);
}

int main() {
	int T;
	read(T);
	while(T--){
		ll l,r;
		read(l),read(r);
		dl(solve(r) - solve(l - 1));
	}
	return 0;
}