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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <cmath>

using namespace std;


struct Node {
    long long value;
    Node *parent;
    vector<Node *> children;
    unordered_map<long long, long long> ranges;

    Node(long long v) : value(v), parent(nullptr) {}
};

vector<long long> generated;
unordered_map<long long, Node *> allNodes;
vector<vector<Node *>> treeNodes(10);

long long productDigits(long long n) {
    if (n == 0) return 0;
    long long product = 1;
    while (n > 0) {
        product *= (n % 10);
        n /= 10;
    }
    return product;
}

long long countDigits(long long n) {
    if (n == 0) {
        return 1;
    }
    if (n < 0) {
        n = -n;
    }
    long long count = 0;
    while (n > 0) {
        n /= 10;
        ++count;
    }
    return count;
}

void collectNodes(Node *root, vector<Node *> &result) {
    if (!root)
        return;

    result.push_back(root);
    for (Node *child : root->children) {
        collectNodes(child, result);
    }
}

vector<Node *> getTreeNodes(long long root) {
    vector<Node *> result;
    collectNodes(allNodes[root], result);
    sort(result.begin(), result.end(), [](const Node *a, const Node *b) {
        return a->value < b->value;
        });
    return result;
}

long long makeSingleQuery(long long num, long long prefix, long long digits) {
    if (prefix == 0) {
        return 0;
    }
    if (num % prefix != 0) {
        return 0;
    }
    if (digits == 0) {
        return prefix == num ? 1 : 0;
    }
    return allNodes[num / prefix]->ranges[digits];
}

long long makeQueryWithoutPrefix(long long num, long long digits) {
    long long sum = 0;
    for (Node *node : treeNodes[num]) {
        sum += node->ranges[digits];
    }
    return sum;
}


long long makeQueryWithPrefix(long long num, long long prefix, long long digits) {
    long long sum = 0;
    for (Node *node : treeNodes[num]) {
        sum += makeSingleQuery(node->value, prefix, digits);
    }
    return sum;
}

long long makeQuery(long long num, long long query) {
    long long digits = countDigits(query);
    long long sum = 0;
    for (long long i = 1; i < digits; i++) {
        sum += makeQueryWithoutPrefix(num, i);
    }
    sum += makeQueryWithPrefix(num, productDigits(query), 0);
    for (long long i = 1; i <= digits; i++) {
        long long modulus = pow(10, i);
        while (query % modulus > 0) {
            long long step = modulus / 10;
            query -= step;
            if (query > 0) {
                long long prefix = productDigits(query / step);
                if (prefix > 0) {
                    sum += makeQueryWithPrefix(num, prefix, i - 1);
                }
            }
        }
    }
    return sum;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    const long long LIMIT = 1000000000000000000ULL; // 10^18

    for (long long p2 = 1; p2 < LIMIT; p2 *= 2) {
        for (long long p3 = 1; p3 < LIMIT; p3 *= 3) {
            if (p2 > LIMIT / p3) break;
            for (long long p5 = 1; p5 < LIMIT; p5 *= 5) {
                if (p2 * p3 > LIMIT / p5) break;
                for (long long p7 = 1; p7 < LIMIT; p7 *= 7) {
                    if (p2 * p3 * p5 > LIMIT / p7) break;
                    long long x = p2 * p3 * p5 * p7;
                    if (x < LIMIT)
                        generated.push_back(x);
                }
            }
        }
    }

    generated.push_back(0);
    sort(generated.begin(), generated.end());
    for (auto num : generated) {
        allNodes[num] = new Node(num);
    }

    for (auto num : generated) {
        if (num < 10) continue;
        long long parentVal = productDigits(num);
        allNodes[num]->parent = allNodes[parentVal];
        allNodes[parentVal]->children.push_back(allNodes[num]);
    }

    long long t;
    cin >> t;
    vector<long long> numbers(t);
    long long maxDigits = 0;
    for (long long i = 0; i < t; ++i) {
        cin >> numbers[i];
        long long digits = countDigits(numbers[i]);
        if (digits > maxDigits) {
            maxDigits = digits;
        }
    }

    for (auto num : generated) {
        if (num < 1) continue;
        if (num < 10) {
            allNodes[num]->ranges[1] = 1;
        }
        for (long long digits = 2; digits <= maxDigits; digits++) {
            long long sum = 0;
            for (long long digit = 1; digit < 10; digit++) {
                if (num % digit == 0) {
                    long long count = allNodes[num / digit]->ranges[digits - 1];
                    sum += count;
                }
            }
            allNodes[num]->ranges[digits] = sum;
        }
    }
    for (long long num = 1; num < 10; num++) {
        treeNodes[num] = getTreeNodes(num);
    }

    for (long long i = 0; i < t; i++) {
        vector<long long> results(10);
        long long sum = 0;
        for (long long number = 1; number < 10; number++) {
            results[number] = makeQuery(number, numbers[i]);
            sum += results[number];
        }
        cout << (numbers[i] - sum);
        for (long long number = 1; number < 10; number++) {
            cout << " " << results[number];
        }
        cout << " " << endl;
    }
}