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
173
174
#include <iostream>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstdlib>
#include <cassert>

using namespace std;

struct NodeData {
    long long childrenNum[18] = {};
    vector<long long> children;
    long long parent, num;
};

unordered_map<long long, NodeData> nodes;

long long parent(long long num) {
    long long res = 1;
    while (num > 0) {
        auto dn = div(num, 10ll);
        num = dn.quot;
        res *= dn.rem;
    }
    return res;
}

void build() {
    for (int i = 0; i < 10; ++i) {
        auto &n = nodes[i];
        n.parent = -1;
        n.num = i;
    }
    long long num = 1;
    for (int i2 = 0;; ++i2) {
        for (int i3 = 0;; ++i3) {
            for (int i5 = 0;; ++i5) {
                for (int i7 = 0;; ++i7) {
                    nodes[num].parent = parent(num);
                    nodes[num].num = num;
                    if (num > 9) {
                        nodes[nodes[num].parent].children.push_back(num);
                    }
                    num *= 7;
                    if (num > 1'000'000'000'000'000'000ll) {
                        for (int i = 0; i <= i7; ++i) num /= 7;
                        break;
                    }
                }
                num *= 5;
                if (num > 1'000'000'000'000'000'000ll) {
                    for (int i = 0; i <= i5; ++i) num /= 5;
                    break;
                }
            }
            num *= 3;
            if (num > 1'000'000'000'000'000'000ll) {
                for (int i = 0; i <= i3; ++i) num /= 3;
                break;
            }
        }
        num *= 2;
        if (num > 1'000'000'000'000'000'000ll) {
            for (int i = 0; i <= i2; ++i) num /= 2;
            break;
        }
    }
    assert(num == 1);
    for (int digit = 0; digit < 10; ++digit) {
        nodes[digit].childrenNum[1] = 1;
    }
    for (int digits = 2; digits < 18; ++digits) {
        for (int digit = 1; digit < 10; ++digit) {
            for (auto &[a, b] : nodes) {
                if (a % digit == 0) {
                    b.childrenNum[digits] += nodes[a / digit].childrenNum[digits - 1];
                }
            }
        }
    }
}

vector<int> digits(long long n) {
    vector<int> res;
    while (n > 0) {
        res.push_back(n % 10);
        n /= 10;
    }
    ranges::reverse(res);
    return res;
}

long long parentN(long long n) {
    while (n > 9) {
        n = parent(n);
    }
    return n;
}

long long getAllPrefix(long long digitNum, long long d, long long prefix) {
    if (digitNum == 0) {
        return parentN(prefix) == d;
    }
    long long res{};
    queue<long long> q;
    q.push(d);
    while (!q.empty()) {
        auto e = q.front();
        q.pop();
        if (e % prefix == 0) {
            res += nodes[e / prefix].childrenNum[digitNum];
        }
        for (auto c : nodes[e].children) {
            q.push(c);
        }
    }
    return res;
}

long long getByDigit(const vector<int> &digits, long long digit) {
    if (empty(digits)) return 0;

    long long res{};
    long long prefix = 1;
    for (unsigned d = 0; d < size(digits); ++d) {
        for (int fd = 1; fd < digits[d]; ++fd) {
            res += getAllPrefix(size(digits) - d - 1, digit, prefix * fd);
        }
        prefix *= digits[d];
    }
    if (parentN(prefix) == digit) ++res;
    return res;
}

void doOne() {
    long long n, nn;
    cin >> n;
    vector<long long> res;
    res.resize(10);
    if (n == 1'000'000'000'000'000'000ll) {
        nn = n - 1;
    } else {
        nn = n;
    }
    vector<int> digs = digits(nn);
    for (unsigned d = 1; d < size(digs); ++d) {
        for (int i = 1; i < 10; ++i) {
            res[i] += getAllPrefix(d, i, 1);
        }
    }
    for (int i = 1; i < 10; ++i) {
        res[i] += getByDigit(digs, i);
    }
    res[0] = n;
    for (int i = 1; i < 10; ++i) {
        res[0] -= res[i];
    }
    for (int i = 0; i < 10; ++i) {
        cout << res[i] << ' ';
    }
    cout << '\n';
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL);
    int t;
    cin >> t;
    build();
    for (int i = 0; i < t; ++i) {
        doOne();
    }
}