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
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>

struct Data {
    int init_position;
    unsigned long long ni;
    int results[10];
};

short limes(unsigned long long i) {
    if (i < 10) {
        return i;
    }
    unsigned long long mul = 1;
    while (i > 0) {
        unsigned long long digit = i % 10;
        if (digit == 0) {
            return 0;
        }
        mul *= digit;
        i = (i - digit) / 10;
    }
    return limes(mul);
}

void play(std::vector<Data> *data, unsigned long long i) {
    unsigned long long a, b;
    if (i == 0) {
        a = 1;
    } else {
        a = (*data)[i - 1].ni + 1;
        for (int j = 0; j < 10; j++) {
            (*data)[i].results[j] = (*data)[i - 1].results[j];
        }
    }
    b = (*data)[i].ni;
    for (unsigned long long it = a; it <= b; it++) {
        (*data)[i].results[limes(it)]++;
    }
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL);
    int t;
    std::cin >> t;
    std::vector<Data> days;
    days.assign(t, {});
    for (int i = 0; i < t; i++) {
        std::cin >> days[i].ni;
        days[i].init_position = i;
    };
    for (int i = 0; i < 10; i++) {
        days[0].results[i] = 0;
    };
    std::sort(days.begin(), days.end(), [](Data &a, Data &b) {
        return a.ni < b.ni;
    });
    for (int i = 0; i < t; i++) {
        play(&days, i);
    }
    std::sort(days.begin(), days.end(), [](Data &a, Data &b) {
        return a.init_position < b.init_position;
    });
    for (int i = 0; i < t; i++) {
        for (int j = 0; j < 10; j++) {
            std::cout << days[i].results[j] << " ";
        }
        std::cout << "\n";
    }
}