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
#include <algorithm>
#include <array>
#include <cstdint>
#include <cstdio>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>

const std::vector<uint64_t> FACTORIAL = {1uLL,
                                         1uLL,
                                         2uLL,
                                         6uLL,
                                         24uLL,
                                         120uLL,
                                         720uLL,
                                         5040uLL,
                                         40320uLL,
                                         362880uLL,
                                         3628800uLL,
                                         39916800uLL,
                                         479001600uLL,
                                         6227020800uLL,
                                         87178291200uLL,
                                         1307674368000uLL,
                                         20922789888000uLL,
                                         355687428096000uLL,
                                         6402373705728000uLL,
                                         121645100408832000uLL,
                                         2432902008176640000uLL};
std::map<std::set<uint8_t>, uint64_t> cache;

struct Digits {
  Digits() : counter({}), size_(0) {}

  uint8_t size() const { return size_; }

  void insert(const uint8_t& n) {
    ++size_;
    counter[n]++;
  }

  void remove(const uint8_t& n) {
    --size_;
    counter[n]--;
  }

  bool empty() const { return size_ == 0; }

  uint8_t max() const {
    for (int i = 9; i >= 1; --i) {
      if (0 < counter[i]) {
        return i;
      }
    }
    return -1;
  }
  uint64_t value() const {
    uint64_t x = 1;
    for (int i = 1; i <= 9; ++i) {
      for (int j = 1; j <= counter[i]; ++j) {
        x *= i;
      }
    }
    return x;
  }
  uint64_t permutations() const {
    uint64_t permutations = FACTORIAL[size_];
    uint64_t aaa = 1;
    for (int i = 1; i <= 9; ++i) {
      if (1 < counter[i]) {
        aaa *= FACTORIAL[counter[i]];
      }
    }
    if (1 < aaa)
      permutations /= aaa;
    return permutations;
  };

  std::array<uint8_t, 10> counter;
  uint8_t size_;
};

std::vector<uint8_t> toDigits(uint64_t n) {
  std::vector<uint8_t> digits;
  while (0 < n) {
    digits.push_back(n % 10);
    n /= 10;
  }
  return digits;
}

struct Query {
  Query(const uint64_t& n_) : n(n_), solution{}, maxDigits(toDigits(n)) {}

  uint64_t n;
  std::array<uint64_t, 10> solution;
  std::vector<uint8_t> maxDigits;
};
using Queries = std::vector<Query>;
constexpr uint8_t NO_DIGIT = 100;

uint8_t getLog10(uint64_t n) {
  uint8_t result = 0;
  while (0 < n) {
    result++;
    n /= 10;
  }
  return result;
}

uint64_t getPermutations(const Digits& digits) { return digits.permutations(); }

uint64_t getPermutations(Digits& digits, std::vector<uint8_t>& maxDigits) {
  if (maxDigits.empty()) {
    return 1;
  } else if (digits.size() < maxDigits.size()) {
    return getPermutations(digits);
  }
  uint64_t subPermutations = 0;
  const auto maxValue = maxDigits.back();
  for (int i = 1; i <= maxValue; ++i) {
    if (0 < digits.counter[i]) {
      digits.remove(i);
      if (i == maxValue) {
        maxDigits.pop_back();
        subPermutations += getPermutations(digits, maxDigits);
        maxDigits.push_back(maxValue);
      } else if (i < maxValue) {
        subPermutations += getPermutations(digits);
      }
      digits.insert(i);
    }
  }
  return subPermutations;
}

uint8_t getDigit(const uint64_t& n) {
  if (n < 10) {
    return n;
  }
  uint64_t result = 1;
  uint64_t value = n;
  while (0 < value) {
    result *= value % 10;
    value /= 10;
  }
  return getDigit(result);
}

void generate(Digits& digits, Queries& queries, const int& maxDigitsCount) {
  if (!digits.empty()) {
    const uint8_t digit = getDigit(digits.value());
    for (Query& query : queries) {
      if (digits.size() <= query.maxDigits.size()) {
        query.solution[digit] += getPermutations(digits, query.maxDigits);
      }
    }
  }
  if (digits.size() < maxDigitsCount) {
    for (int i = digits.empty() ? 1 : digits.max(); i <= 9; ++i) {
      digits.insert(i);
      generate(digits, queries, maxDigitsCount);
      digits.remove(i);
    }
  }
}

int main() {
  int t;
  uint64_t n;
  scanf("%d", &t);
  Queries queries;
  uint64_t max = 1;
  for (int i = 0; i < t; ++i) {
    scanf("%lu", &n);
    max = std::max(max, n);
    queries.emplace_back(n);
  }

  Digits digits;
  const uint8_t maxDigitsCount = getLog10(max == 1 ? 1 : max - 1);
  generate(digits, queries, maxDigitsCount);
  for (auto& query : queries) {
    query.solution[0] = query.n - std::accumulate(query.solution.begin() + 1, query.solution.end(), static_cast<uint64_t>(0));
    for (const auto& value : query.solution) {
      printf("%lu ", value);
    }
    printf("\n");
  }
  return 0;
}