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
#include <bits/stdc++.h>
using namespace std;
unordered_map<int,int>dp;
int f(int x){
    if(x <= 9){
        dp[x] = x;
        return x;
    }
    else if(dp.find(x) != dp.end()){
        return dp[x];
    }
    else{
        int y = 1;
        while(x){
            y *= (x%10);
            x /= 10;
        }
        dp[x] = f(y);
        return dp[x];
    }
}
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t; cin >> t;
    while(t--){
        int n; cin >> n;
        vector<int>tab(10);
        int pt = 1;
        while(n--){
            tab[f(pt)]++;
            ++pt;
        }
        for(int i = 0; i < 10; ++i){
            cout << tab[i] << " ";
        }
        cout << endl;
    }
}