[luogu]P4127 [AHOI2009]同类分布[数位dp]

题目

给出两个数a,b,求出[a,b]中各位数字之和能整除原数的数的个数。

数位dp

  以总和作为最终状态数进行枚举,记为mod

同时统计中间状态sum(已处理数位的数字和)与r(数字值的值)

故状态为

其中最后一维要进行枚举，故可省去

然后套用数位dp的模板即可 

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

typedef long long LL;
LL a, b;
LL split(LL);

int main(){
  cin >> a >> b;
  cout << split(b) - split(a - 1) << endl;
  return 0;
}

int p[23];
LL dp[20][200][200];
LL solve(int pos, int sum, int r, int mod, bool limit);
LL split(LL x){
  int pos = 0;
  while(x){
    p[++pos] = x % 10;
    x /= 10;
  }
  LL res = 0;
  for(int i = 1; i <= 9 * pos; i++){
    memset(dp, -1, sizeof(dp));
    res += solve(pos, 0, 0, i, 1);
  }
  return res;
}

LL solve(int pos, int sum, int r, int mod, bool limit){
  if(!pos){
    if(!r && sum == mod) return 1;
    else return 0;
  }
  if(!limit && dp[pos][sum][r] != -1)
    return dp[pos][sum][r];
  LL res = 0, top = (limit) ? p[pos] : 9, i;
  for(i = 0; i <= top; i++)
    res += solve(pos - 1, sum + i, (r * 10 + i) % mod, mod, limit & (i == top));
  if(!limit)
    dp[pos][sum][r] = res;
  return res;
}