Classy Numbers （数位dp）

题目链接：https://cn.vjudge.net/problem/CodeForces-1036C

题意：求有多少数1-9的数字不超过3个

题解：

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<ctype.h>
#include<vector>
#include<algorithm>
#include<sstream>
#define PI acos(-1.0)
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")

using namespace std;
typedef long long ll;
int di[32];
ll dp[32][32];
ll dfs(int len,int num,bool limit)
{
    if(len <= 0)  return num <= 3;
    if(!limit&&dp[len][num]!=-1) return dp[len][num];
    ll ans = 0;
    int _max = limit ? di[len] : 9;
    for(int i=0;i<=_max;i++){
        if(num > 3)   continue;
        ans += dfs(len-1,num+(i!=0),limit&&i==_max);
    }
    if(!limit)  dp[len][num] = ans;
    return ans;

}
ll solve(ll num)
{
    int k = 0;
    while(num){
        di[++k] = num % 10;
        num /= 10;
    }
    return dfs(k,0,true);
}
int main(void)
{
    int t;
    ll l,r;
    scanf("%d",&t);
    memset(dp,-1,sizeof(dp));
    while(t--){
        scanf("%lld%lld",&l,&r);
        printf("%lld\n",solve(r)-solve(l-1));
    }
    return 0;
}