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

using namespace std;

long long silnia[20];
long long power[10][20];

long long ret[10];
int ile[10];

int stabilize(long long x) {
    if (x < 10)
        return x;
    long long y = 1;
    while (x) {
        y *= (x % 10);
        x /= 10;
    }
    return stabilize(y);
}

void check_perms(int jeszcze, int minpos, long long mn, int dl) {
    if (jeszcze == 0) {
        long long stab = mn;
        for (int i = 0; i <= 9; i++) {
            stab *= power[i][ile[i]];
        }
        stab = stabilize(stab);

        long long num_perm = silnia[dl];
        for (int i = 0; i <= 9; i++) {
            num_perm /= silnia[ile[i]];
        }
        ret[stab] += num_perm;
        return;
    }
    for (int i = minpos; i <= 9; i++) {
        ile[i]++;
        check_perms(jeszcze - 1, i, mn, dl);
        ile[i]--;
    }
}

void solve(long long n) {
    memset(ret, 0, 10 * sizeof (long long));
    vector<int> v;
    while (n) {
        v.push_back(n % 10);
        n /= 10;
    }
    std::reverse(v.begin(), v.end());

    // shorter numbers
    for (int dl = 1; dl < v.size(); dl++) {
        for (int pocz = 1; pocz <= 9; pocz++) {
            check_perms(dl - 1, 0, pocz, dl - 1);
        }
    }

    for (int pocz = 1; pocz < v[0]; pocz++) {
        check_perms(v.size() - 1, 0, pocz, v.size() - 1);
    }

    long long mn = v[0];

    for (int pos = 1; pos < v.size(); pos++) {
        for (int pocz = 0; pocz < v[pos]; pocz++) {
            check_perms(v.size() - pos - 1, 0, mn * pocz, v.size() - pos - 1);
        }
        mn *= v[pos];
    }
    ret[stabilize(mn)]++;
}

int main() {
    silnia[0] = 1;
    for (long long i = 1; i < 20; i++) {
        silnia[i] = silnia[i - 1] * i;
    }
    for (int i = 0; i <= 9; i++) {
        power[i][0] = 1;
        for (int j = 1; j <= 18; j++) {
            power[i][j] = power[i][j - 1] * i;
        }
    }

    int t;
    long long n;
    cin >> t;
    for (int i = 1; i <= t; i++) {
        cin >> n;
        solve(n);
        for (int i = 0; i <= 9; i++) {
            cout << ret[i] << " ";
        }
        cout << endl;
    }

    return 0;
}