给定两个正整数a和b,求在[a,b]中的所有整数中,每个数码(digit)各出现了多少次。
输入格式:
输入文件中仅包含一行两个整数a、b,含义如上所述。
输出格式:
输出文件中包含一行10个整数,分别表示0-9在[a,b]中出现了多少次。
输入样例#1:
1 99
输出样例#1:
9 20 20 20 20 20 20 20 20 20
分析:类似于写的这个题;
这个题要除去前导0,其他就是把之前的16进制改成10进制枚举[0,9]就行了;
#include <bits/stdc++.h>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
#define met(s) memset(s, 0, sizeof(s))
#define rep(i, a, b) for(int i = a; i <= b; ++i)
template <class T> inline void scan_d(T &ret) {
char c; ret = 0;
while ((c = getchar()) < '0' || c > '9');
while (c >= '0' && c <= '9') {
ret = ret * 10 + (c - '0'), c = getchar();}}
typedef long long LL;
typedef unsigned long long ull;
typedef pair<LL, LL> pii;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int MAXN = 1e5 + 10;
LL a[15], b[15], f[15];
LL dp[15][10][10][2];
inline LL dfs(LL pos, LL x, LL k, LL limit, LL sta) {
if(pos < 0) return 0;
if(dp[pos][x][k][sta] >= 0 && !limit) return dp[pos][x][k][sta];
LL up = limit ? a[pos] : 9;
LL ans = 0, cnt;
for(LL i = 0; i <= up; ++i) {
if(limit && i == up) cnt = b[pos];
else cnt = f[pos];
if(sta && i == 0) ans += dfs(pos - 1, i, k, limit && i == up, sta && i == 0);
else if(i == k) ans += dfs(pos - 1, i, k, limit && i == up, sta && i == 0) + cnt;
else ans += dfs(pos - 1, i, k, limit && i == up, sta && i == 0);
}
//printf("$$ %lld %lld %lld %lld\n", pos, x, ans, up);
if(!limit) dp[pos][x][k][sta] = ans;
return ans;
}
inline LL so(LL x, LL k) {
memset(a, 0, sizeof(a));
LL p = 0;
while(x) {
a[p++] = x % 10;
x /= 10;
}
b[1] = a[0] + 1; b[0] = f[0] = 1ll;
for(LL i = 1; i <= 13; ++i) f[i] = f[i - 1] * 10;
for(LL i = 2; i < p; ++i) b[i] = a[i - 1] * f[i - 1] + b[i - 1];
return dfs(p - 1, 0, k, 1ll, 1ll);
}
int main() {
memset(dp, -1, sizeof(dp));
LL A, B;
scanf("%lld %lld", &A, &B);
for(LL i = 0; i < 10; ++i) {
printf("%lld%c", so(B, i) - so(A - 1, i), ((i == 9) ? '\n' : ' '));
}
return 0;
}