数位dp - 例题

HDU - 4734

dp[pos][sum]
sum表示在当前位置下，还可以放多少权值的数

AC代码

#include <bits/stdc++.h>
inline long long read(){char c = getchar();long long x = 0,s = 1;
while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}
while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}
return x*s;}
using namespace std;
#define NewNode (TreeNode *)malloc(sizeof(TreeNode))
#define Mem(a,b) memset(a,b,sizeof(a))
#define lowbit(x) (x)&(-x)
const int N = 1e4 + 10;
const long long INFINF = 0x7f7f7f7f7f7f7f;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-5;
const int mod = 1e9+7;
const double II = acos(-1);
const double PP = (II*1.0)/(180.00);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> piil;
ll dp[20][N],arr[20],all;
ll dfs(ll pos,ll sum,bool limit)
{
    if(pos == -1)//状态变化
    {
        if(sum <= all)
            return 1;
        else
            return 0;
    }
    if(sum > all) return 0;
    if(!limit && dp[pos][all-sum] != -1) return dp[pos][all-sum];
    ll up = limit ? arr[pos] : 9,ans = 0;
    for(int i = 0;i <= up;i++)
    {
        ans += dfs(pos-1,sum + (i<<pos),limit && i == arr[pos]);
    }
    if(!limit) dp[pos][all-sum] = ans;
    return ans;
}
ll solve(ll m,ll n)
{
    ll pos = 0,num = 0;
    all = 0;
    while(n)
    {
        arr[pos++] = n%10;
        n /= 10;
    }
    while(m)
    {
        ll a = m%10;
        all = all + (a<<num);
        m /= 10;
        num++;
    }//all表示的是f(a)
    return dfs(pos-1,0,true);
}
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    //    freopen("input.txt","r",stdin);
    //    freopen("output.txt","w",stdout);
    int t;
    cin >> t;
    memset(dp,-1,sizeof(dp));
    for(int i = 1;i <= t;i++)
    {
        ll a,b;
        cin >> a >> b;
        printf("Case #%d: %lld\n",i,solve(a,b));
    }
    return 0;
}