1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
#include <iostream>
#include <unordered_map>


using namespace std;


typedef long long ll;

int count(ll n) {
    int result =1;
    while(n >9) {
        n/=10;
        result ++;
    }
    return result;
}



ll find3(ll x, ll m=1) {
    if (x < 10) return x*m;
    return find3(x/10, (x%10) *m);
}

ll find2 (ll x, ll m=1) {
    if (x*m <10) return x*m;
    if (x < 10) return find2(m*x);
    return find2(x/10, (x%10) *m);
}

///////////////////////////////////////hash mapa
//#define MAP_SIZE   100003
#define MAP_SIZE   200009
//#define MAP_SIZE    50021
#define DATA_SIZE  10000000

struct Data {
    int data;
    ll key;
    int next;
};

//data starts at data[1]
Data mdata[DATA_SIZE];
int data_size = 0;

int hashMap[MAP_SIZE];
int map_size; //needed only for benchmarking

inline int mhash(ll key) {
    return key % MAP_SIZE;
}

void put(int idx) {
    int h = mhash(mdata[idx].key);
    mdata[idx].next = hashMap[h];
    hashMap[h] = idx;
}

int get(ll key) {
    int idx = hashMap[mhash(key)];
    while (idx != 0 && mdata[idx].key != key)
        idx = mdata[idx].next;
    return idx;
}

///////////////////////////////////////


unordered_map<ll,int> find_m;

int f_C;
int f_M;

int find (ll x) {   
    if (x < 10) return x;
    if(x%10 == 0) return 0;
    f_C++;
    auto idx = get(x);
    if(idx!=0) return mdata[idx].data;
    f_M++;
    ll r = find(find3(x));
    mdata[data_size].data = r;
    mdata[data_size].key = x;
    put(data_size++);
    return r;
}


struct Sum {
    unordered_map<ll, ll> c;

    void add(Sum &s, ll x=1) { 
        for(auto &v : s.c) {
            ll  m = x*v.first;
            if(m%10 == 0) m = 0;
            c[m] += v.second; 
        }
    }
    void add10(Sum &s, ll x=1){ for(auto &v : s.c) c[find(x*v.first)] += v.second; }
};


Sum sum0[20], sum1[20];
ll t,n;
ll p10[20];

struct FSum {
    ll v[10000];
    ll c[10000];
    int ile;
};

FSum sum0f[20];


int get(ll n, int c) {
    return (n/p10[c])%10;
}



int main() {
    sum0[0].c[1]=1;
    p10[0] =1;
    for(int c=1;c<20;c++) p10[c] = 10*p10[c-1];
    for(int c=1;c<19;c++) {
        for(int v=0;v < 10;v++) {
            sum0[c].add(sum0[c-1], v);
        }
        for(int v=1;v < 10;v++) {
            sum1[c].add10(sum0[c-1], v);
        }
    }

    for(int c=2;c<19;c++) sum1[c].add10(sum1[c-1]);

    for(int c=0;c<19;c++) {
        for(auto &v: sum0[c].c) {
            sum0f[c].v[sum0f[c].ile]   = v.first;
            sum0f[c].c[sum0f[c].ile++] = v.second;
        }
    }

    cin >> t;
    while(t--) {
        cin >> n;
        ll tmp[10] = {};
        int cyfr = count(n);
        for(auto &v :sum1[cyfr-1].c)  tmp[v.first]+=v.second;

        ll mul = 1;
        int od = 1;
        for(int c=cyfr-1;c>=0;c--) {
            int cyfra = get(n,c);
            int do_ = cyfra+(c==0?1:0);
            for(int i=0;i<sum0f[c].ile;i++) {
                ll v = sum0f[c].v[i] *mul;
                ll s = sum0f[c].c[i];
                for(int o=od;o<do_;o++) {
                    tmp[find(v * o)]+= s;
                }
            }
            mul *= cyfra;
            od = 0;
        }
        for(int i=0; i< 10;i++) printf("%llu ",tmp[i]);
        printf("\n");
    }
    //cerr << "find_m size: "  << data_size  << " C:" << f_C << " M:" << f_M << "\n";
}