数位dp

学习blog：https://blog.csdn.net/wust_zzwh/article/details/52100392

http://acm.hdu.edu.cn/showproblem.php?pid=4734
令dp[pos][sum]表示pos位置需要满足$\le$sum的个数

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 5;
int dp[13][maxn];
int fib_2[13];
int a[13], p, all;
int dfs(int pos, int sum, bool limit) {
	if (pos == -1) return sum <= all;
	if (sum > all) return 0;
	if (!limit && dp[pos][all - sum] != -1)
		return dp[pos][all - sum];
	int up = limit ? a[pos] : 9, ans = 0;
	for (int i = 0; i <= up; ++i) 
		ans += dfs(pos - 1, sum + i * fib_2[pos], limit && i == a[pos]);

	if (!limit) 
		dp[pos][all - sum] = ans;
	return ans;
}
int solve(int x, int y) {
	p = all = 0;
	for (int i = 0; x; ++i) {
		all += (x % 10) * fib_2[i];
		x /= 10;
	}
	while (y) {
		a[p++] = y % 10;
		y /= 10;
	}
	return dfs(p - 1, 0, 1);
}

int main()
{
	fib_2[0] = 1;
	for (int i = 1; i <= 9; ++i)
		fib_2[i] = fib_2[i - 1] * 2;
	memset(dp, -1, sizeof(dp));
	int t; scanf("%d", &t);
	for (int cas = 1; cas <= t; ++cas) {
		int x, y; scanf("%d%d", &x, &y);
		printf("Case #%d: %d\n", cas, solve(x, y));
	}
}

http://poj.org/problem?id=3252
求给定区间内满足二进制中0的数量多于1的数量
令$dp[pos][num]$表示pos位置0的数量-1的数量为num的数量，最后即求$pos=1$时$num\ge 0$的个数
注意前导0的影响

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 5;
int dp[35][100], a[35], p;
int dfs(int pos, int num, bool lead, bool limit) {
	if (pos == -1) return num >= 32;
	if (!lead && !limit && dp[pos][num] != -1)
		return dp[pos][num];
	int up = limit ? a[pos] : 1;
	int ans = 0;
	for (int i = 0; i <= up; ++i) {
		if (lead && i == 0)
			ans += dfs(pos - 1, num, lead && i == 0, limit && i == a[pos]);
		else
			ans += dfs(pos - 1, num + (i == 0 ? 1 : -1), lead && i == 0, limit && i == a[pos]);
	}
	if (!lead && !limit)
		dp[pos][num] = ans;
	return ans;
}
int solve(int x) {
	p = 0;
	while (x) {
		a[p++] = x % 2;
		x /= 2;
	}
	return dfs(p - 1, 32, true, true);
}
int main()
{
	memset(dp, -1, sizeof(dp));
	int a, b;
	while (~scanf("%d%d", &a, &b)) {
		printf("%d\n", solve(b) - solve(a - 1));
	}
}

http://acm.hdu.edu.cn/showproblem.php?pid=4507
求区间内满足　1、整数中某一位是7；2、整数的每一位加起来的和是7的整数倍；3、这个整数是7的整数倍；的数的平方和
1可以用不枚举$i=7$来限制，2可以存储每位相加的和$sum$，3可以存储这个数$val$，满足的数即为$sum\ne 0$并且$val\ne 0$（$mod7$的意义下）
平方和处理为考虑枚举的该位的贡献$(i\times 10^{pos}{)}^2\times cnt+2\times i\times 10^{pos}\times sum+sqr$，cnt分别为下一位能形成的数的个数，sum为下一位能形成的数的和，sqr即是能形成的数的平方和，递推一下

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e4 + 5;
const ll mod = 1e9 + 7;
ll add(ll a, ll b) {
	if (a + b >= mod)
		return a + b - mod;
	return a + b;
}
ll mul(ll a, ll b) {
	return a * b >= mod ? a * b % mod : a * b;
}
struct node
{
	ll cnt, sum, sqr;
	node() {}
	node(ll _cnt, ll _sum, ll _sqr) {
		cnt = _cnt; sum = _sum; sqr = _sqr;
	}
} dp[25][10][10];
int a[25], p;
ll fib_10[25];
node dfs(int pos, int sum, int val, bool limit) {
	if (pos == -1) {
		if (sum != 0 && val != 0)
			return node(1, 0, 0);
		return node(0, 0, 0);
	}
	if (!limit && dp[pos][sum][val].cnt != -1) 
		return dp[pos][sum][val];
	int up = limit ? a[pos] : 9;
	node now = node(0, 0, 0);
	for (int i = 0; i <= up; ++i) {
		if (i == 7) continue;
		node rhs = dfs(pos - 1, (sum + i) % 7, (val * 10 + i) % 7, limit && i == a[pos]); 
		if (rhs.cnt == 0) 
			continue;    
		now.cnt = add(now.cnt, rhs.cnt);
		ll A = mul(i, fib_10[pos]);
		now.sum = add(now.sum, add(rhs.sum, mul(rhs.cnt, A)));
		now.sqr = add(add(add(mul(rhs.cnt, mul(A, A)), mul(2 * A, rhs.sum)), rhs.sqr), now.sqr);
	}
	if (!limit)
		dp[pos][sum][val] = now;
	return now;
}      
ll solve(ll x) {
	p = 0;
	while (x) {
		a[p++] = x % 10;
		x /= 10;
	}
	return dfs(p - 1, 0, 0, true).sqr;
}

int main()
{
	fib_10[0] = 1;
	for (int i = 1; i <= 20; ++i)
		fib_10[i] = mul(fib_10[i - 1], 10);
	for (int i = 0; i <= 20; ++i)
		for (int j = 0; j <= 9; ++j)
			for (int k = 0; k <= 9; ++k)
				dp[i][j][k].cnt = -1;
	int t; scanf("%d", &t);
	while (t--) {
		ll a, b; scanf("%lld%lld", &a, &b);
		printf("%lld\n", (solve(b) - solve(a - 1) + mod) % mod);
	}
}