The Counting Problem UVA - 1640

题意：给出整数a,b，统计a和b（包含a和b）之间的整数中，数字0,1,2,3,4,5,6,7,8,9分别出现了多少次。1<=a,b<=1e8。注意a有可能大于b

思路：看别人的题解愣是看了一个多小时才想明白，惭愧

思路链接

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
#define mod 1000000007;
using namespace std;
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
const int maxn = 1e8 + 2;
void Cal(char *s,int *num)
{
    int j,k,n,t;
    n = strlen(s);
    for(int i = k = 1;i < n;i++)
        k *= 10,num[0] -= k;
    for(int i = 0;i < n;i++,k /= 10)
    {
        for(j = 0;j < s[i] - '0';j++) num[j] += k;
        for(t = 0;t < 10;t++) num[t] += k / 10 * (n - i - 1) * j;
        if(i + 1 < n) num[j] += atoi(s + i + 1);
        num[j]++;
    }
}
int main()
{
    char s[22];
    int n,m,a[11],b[11];
    while(scanf("%d%d",&n,&m) && n + m)
    {
        if(n > m) swap(n,m);
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        sprintf(s,"%d",n - 1);
        Cal(s,a);
        sprintf(s,"%d",m);
        Cal(s,b);
        for(int i = 0;i < 9;i++) printf("%d ",b[i] - a[i]);
        printf("%d\n",b[9] - a[9]);
    }
    return 0;
}