《算法竞赛入门经典2ndEdition 》习题3-3 数数字(Digit Counting, Uva1225)

#include <cstdio>
#include <cstring>

using namespace std;

const int maxn = 10000;
int num[maxn + 10][10];

int main()
{
int t, maxm = 0;
scanf("%d", &t);
while(t--)
{
int n;
scanf("%d", &n);
if(maxm < n)
{
for(int i = maxm+1; i <= n; i++)
{
int x = i;
for(int j = 0; j <= 9; j++)
num[i][j] = num[i-1][j];
while(x != 0)
{
num[i][x%10]++;
x /= 10;
}
}
maxm = n;
}
for(int i = 0; i < 9; i++)
printf("%d ", num
[i]);
printf("%d\n", num
[9]);//uva居然不忽略行末空格
}
return 0;
}