UVa - 1225 - Digit Counting(打表计算)

Description   Trung is bored with his mathematics homeworks. He takes a piece of chalk and starts writing a sequence of consecutive integers starting with 1 to N (1 < N < 10000) . After that, he counts the number of times each digit (0 to 9) appears in the sequence. For example, with N = 13 , the sequence is: 12345678910111213 In this sequence, 0 appears once, 1 appears 6 times, 2 appears 2 times, 3 appears 3 times, and each digit from 4 to 9 appears once. After playing for a while, Trung gets bored again. He now wants to write a program to do this for him. Your task is to help him with writing this program.   Input  The input file consists of several data sets. The first line of the input file contains the number of data sets which is a positive integer and is not bigger than 20. The following lines describe the data sets. For each test case, there is one single line containing the number N .   Output  For each test case, write sequentially in one line the number of digit 0, 1,...9 separated by a space.   Sample Input    2 3 13   Sample Output    0 1 1 1 0 0 0 0 0 0 1 6 2 2 1 1 1 1 1 1

思路：打表和0-1背包很像 f[i][j]表示 n=i的时候 数字j出现的个数。类比0-1背包中，f[i][j]表示 前i件物品放入容量为j的背包的最大价值。

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



int f[10000][10];

int main(){
	
//	freopen("input.txt","r",stdin);
	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 num = i;
		//添加各个位 
		while(num){
			f[i][num%10]++;
//			f[i][num/10]++;
			num/=10;
		}
	}
	

	int n;
	
	scanf("%d",&n);
	
	int b;
	while(n--){
		scanf("%d",&b);
		
		for(int i=0 ;i<9 ;i++){
			printf("%d ",f[b][i]);
		}
		printf("%d\n",f[b][9]);
		
	}	

	
	
	return 0;
}