UVA 1225 - Digit Counting

/***
Md. Nazmul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<iostream>
#include<cstdio>
#include<stack>
#include<queue>
#include<map>
#include<vector>
#include<algorithm>
#include<cstring>
#include<sstream>
#include<cmath>
#include <iomanip>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size)  for(int i=0 ; i<size ; i++) cin>>array[i]  ;
#define new_line  pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647


int data[20];

void count_digits(int n)
{
   int c;
   while(n!=0)
   {
     c = n%10;
     data[c]++;
     n = n/10;
   } 

}



int main()
{
    int n,test;
    sc("%d",&test);
    while(test--)
    {
      sc("%d",&n);
      memset(data,0,sizeof(data));
      for(int i=1 ; i<=n ; i++)
      {
         count_digits(i);
      }

      for(int i=0 ; i<=9 ; i++)
      {
        pf("%d",data[i]);
        if(i<9)
         pf(" ");
      }
      pf("\n");
    }

    return 0;
}