（UVA）1225 --Digit Counting（数数字)

题目链接：http://vjudge.net/problem/UVA-1225

 
#include <iostream>   
#include <cstring>  
#include <cstdio>  
 
  
using namespace std;  
  
int f[10000][10];  
  
int main()  
{  
    memset(f, 0, sizeof(f));  
    for (int i = 1 ; i < 10000 ; ++ i) {  
        for (int j = 0 ; j < 10 ; ++ j)  
            f[i][j] = f[i-1][j];  
        int left = i;  
        while (left) {  
            f[i][left%10] ++;  
            left /= 10;  
        }  
    }  
      
    int t,n;  
    while (~scanf("%d",&t))  
    while (t --) {  
        scanf("%d",&n);  
        for (int i = 0 ; i < 9 ; ++ i)  
            printf("%d ",f[n][i]);  
        printf("%d
",f[n][9]);  
    }  
    return 0;  
}  

还写了一个类似的代码，不过WA

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int main()
{
    int t,n,i,temp;
    char ans[10];
    scanf("%d",&t);
    while(t--)
    {
        memset(ans,0,sizeof(ans));
        scanf("%d",&n);
        for(i=1;i<=n;i++)
        {
            temp=i;
            while(temp)
            {
                ans[temp%10]++;
                temp/=10;
            }
        }
        for(i=0;i<9;i++)
            printf("%d ",ans[i]);
        printf("%d
",ans[9]);
    }
    return 0;
}