Uva 1225 Digit Counting

//

用map<int, vector<int> >打表也行

//

#include<iostream>
#include<cstdio>
#include<string.h>
#include<map>
#include<vector>
using namespace std;
const int maxn = 10;
int vis[maxn];
int main()
{
    int T;
    cin >> T;
    while(T--)
    {
        memset(vis,0,sizeof(vis));
        int n;
        cin >> n;
        for(int i = 1; i <= n; ++i)
        {
            int j = i;
            while(j/10)
            {
                vis[j%10]++;
                j/=10;
            }
            vis[j]++;
        }
        for(int i = 0; i < maxn; ++i)
        {
            if(!i) cout << vis[i];
            else cout << " " << vis[i];
        }
        cout << "\n";
    }
    return 0;
}