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

using namespace std;

typedef long long int LL;

using namespace std;

const int DIGS = 10;

int t, n, maxN;
vector<int> nums;

vector<vector<int>> counts, countsSum;

int multDigits(int num)
{
	int res = 1;

	while (num > 1)
	{
		int dig = num % 10;
		res *= dig;

		num /= 10;
	}

	return res;
}

int lastDigAfterMult(int num)
{
	while (num >= 10)
	{
		num = multDigits(num);
	}

	return num;
}

void preprocess()
{
	counts = vector<vector<int>>(maxN + 1, vector<int>(DIGS));

	for (int i = 1; i <= maxN; ++i)
	{
		int lastDig = lastDigAfterMult(i);
		++counts[i][lastDig];
	}

	for (int i = 2; i <= maxN; ++i)
	{
		for (int j = 0; j < DIGS; ++j)
		{
			counts[i][j] += counts[i - 1][j];
		}
	}
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);

	cin >> t;
	while (t--)
	{
		cin >> n;

		if (n > maxN)
		{
			maxN = n;
		}

		nums.push_back(n);
	}

	preprocess();

	for (int x : nums)
	{
		for (int i = 0; i < DIGS; ++i)
		{
			cout << counts[x][i] << ' ';
		}
		cout << endl;
	}

	return 0;
}