Acwing_338计数问题【数位统计DP】

题目链接:Acwing_338计数问题

AC代码:

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

int get(vector<int> num,int l,int r)
{
	int res = 0;
	for (int i = l; i >= r; i--)
		res = res * 10 + num[i];
	return res;
}

int power10(int i)
{
	int res = 1;
	while (i--)
		res *= 10;
	return res;
}

int count(int n, int x)//从1到n当中统计x出现的次数
{
	if (!n) return 0;

	vector<int> num;
	while (n)
	{
		num.push_back(n % 10);
		n /= 10;
	}
	n = num.size();
	int res = 0;
	for (int i = n - 1-!x; i >= 0; i--)
	{
		if (i < n - 1)//第一类
		{
			res += get(num, n - 1, i + 1)*power10(i);
			if(!x) res -= power10(i);
		}
		if (num[i] == x) res += get(num, i - 1, 0);//第二类
		else if (num[i] > x) res += power10(i);//第三类
	}
	return res;
}

int main()
{
	int a, b;
	while (cin >> a >> b, a || b)
	{
		if (a > b) swap(a, b);
		for (int i = 0; i < 10; i++)
		{
			cout << count(b, i) - count(a - 1, i) << " ";
		}
		cout << endl;
	}
	system("pause");
	return 0;
}