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
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define sz(x) (int)(x).size()

int f(ll n) {
    if (n < 10)
        return n;
    vector<int> digits;
    while (n) {
        digits.push_back(n % 10);
        n /= 10;
    }
    ll prod = accumulate(digits.begin(), digits.end(), 1LL, multiplies<ll>());
    return f(prod);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int t;
    cin >> t;

    vector<pair<ll, int>> queries(t);
    for (int i = 0; i < t; i++) {
        cin >> queries[i].first;
        queries[i].second = i;
    }
    sort(queries.begin(), queries.end());

    vector<array<ll, 10>> res(t);
    int m = 1;
    array<ll, 10> a{};
    for (auto [n, i] : queries) {
        while (m <= n) {
            a[f(m)]++;
            m++;
        }
        res[i] = a;
    }

    for (int i = 0; i < t; i++) {
        for (auto x : res[i]) {
            cout << x << " ";
        }
        cout << "\n";
    }
}