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
#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x),end(x)
#define pb push_back
#define st first
#define nd second

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const int INF = 2e9;
const ll LLINF = 2e18;

int compute(ll x)
{
    while(x>9)
    {
        ll tmp=1;
        while(x>0)
        {
            tmp*=(x%10);
            if(tmp==0)
                break;
            x/=10;
        }
        x=tmp;
    }
    return x;
}

void solve()
{
    int t;
    scanf("%d",&t);
    vector<pll> n(t);
    for(int i=0; i<t; ++i)
    {
        scanf("%lld",&n[i].st);
        n[i].nd=i;
    }
    sort(all(n));
    vector<vll> ans(t);
    vll curr(10);
    ll x=1;
    for(auto[k,i]:n)
    {
        while(x<=k)
        {
            ++curr[compute(x)];
            ++x;
        }
        ans[i]=curr;
    }
    for(auto& v:ans)
    {
        for(auto& x:v)
            printf("%lld ",x);
        printf("\n");
    }
}

int main()
{
    //ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int z=1;
    //cin>>z;
    while(z--)
        solve();
    return 0;
}