uva 1225 Dight Counting(数数字)

//把前n个整数顺次放到一起，统计0~9出现的次数#include <stdio.h>#include <stdlib.h>#include <string.h>int main(){    int dight[10];    int n;    scanf("%d",&n);    while(n--){        memset(dight,0,sizeof(dight));        int length;        scanf("%d",&length);        for(int i=1;i<=length;i++){            int number=i;            while(number!=0){                dight[number%10]++;                number/=10;            }        }        for(int j=0;j<=9;j++)            printf("%d%c",dight[j],j==9?'\n':' ');    }    return 0;}