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
#define _CRT_SECURE_NO_WARNINGS                                                 
#include <iostream>                                                             
#include <algorithm>                                                            
#include <vector>                                                               
#include <cmath>                                                                
#include <map>                                                                  
#include <queue>                                                                
#include <set>                                                                  
#include <numeric>                                                              
#include <stack>                                                                
#include <iomanip>   
#include <unordered_map>
using namespace std;
using ll = long long int;
#define debug(x) cout << #x << " = " << x << endl;        

const int pom = 3e7;
int precalc[pom];
int odp[pom][10];
void solve()
{
    ll n;
    cin >> n;
    if (n >= pom)
    {
        for (int i = 0; i < 10; i++)
        {
            cout << odp[pom-1][i] << " ";
        }
        cout << "\n";
    }
    for (int i = 0; i < 10; i++)
    {
        cout << odp[n][i] << " ";
    }
    cout << "\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    for (int i = 0; i <= 19; i++)
    {
        precalc[i] = (i % 10);
    }
    int start = 0;
    for (int i = 20; i < pom; i++)
    {
        if (i % 10 == 0)
        {
            start = 0;
            // cout << endl;
            //cout << i / 10 << ": ";
        }
        precalc[i] = (precalc[start + precalc[(i / 10)]*(i%10)]);
        //cout << precalc[i] << " ";

    }
    for (int i = 1; i < pom; i++)
    {
        for (int j = 0; j < 10; j++)
        {
            odp[i][j] = odp[i - 1][j];
        }
        odp[i][precalc[i]]++;//dodaj ta nowa
    }
    int t;                                                                    
    cin >> t;                                                                 
    while (t--)                                                               
    {                                                                         
        solve();
    }                                                                         
    return 0;
}