UVA_12241_Digits_Count

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <bitset>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <iterator>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;
int a,b;
int valor[]={100000000, 1000000, 100000, 10000, 1000, 100, 10, 1};
int init[]={  7000000,  600000,  50000,  4000,  300,  20,  1, 0};
int dist[]  ={199999999, 1999999, 199999, 19999, 1999, 199, 19, 0};
int maximo=8;
int main() {
    int rest;
    while(scanf("%d %d",&a,&b)){
        if(a==0 && b==0) break;
        int res[10];
        for(int i=0;i<10;i++) res[i]=0;
        while(a<=b){
            if(a==0){res[0]+=1;a++;continue;}
            for(int i=0;i<maximo;i++){
                /*busca el rango correspondiente*/
                if(a >= valor[i] && a%valor[i] == 0 && b-a >= dist[i]){
                     /* suma los valores iniciales */
                    for (int j = 0; j < 10; j++)
                        res[j] += init[i];

                    /* quitamos los n últimos digitos */
                    rest = a/valor[i];

                    /* los dígitos que quedan suman al resultado */
                    while (rest != 0) {
                        res[rest%10] += valor[i];
                        rest /= 10;
                    }

                    /* el nuevo A */
                    a += valor[i];

                    break;
                }
            }
        }
        printf("%d", res[0]);
        for (int i = 1; i < 10; i++)
            printf(" %d", res[i]);
        printf("\n");
    }
    return 0;
}