2151.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2151 on 2005-10-24 at 17:49:14 */ 
#include <cstdio>
#include <cstring>

const int MAX = 1024;
const int M_LEN = 32;

int main()
{
	int n, i, j;
	char line[M_LEN];
	int dic[MAX][M_LEN], aval;
	int scra[M_LEN], blank, need;

	while(scanf("%d", &n) == 1) {
		if(n == 0) {
			return 0;
		} else {
			getchar();
			memset(dic, 0, sizeof(dic));
			for(i = 0; i < n; i++) {
				gets(line);
				for(j = 0; line[j] != '\0'; j++) {
					dic[i][line[j] - 'A']++;
				}
			}
			memset(scra, 0, sizeof(scra));
			blank = 0;
			gets(line);
			for(i = 0; line[i] != '\0'; i++) {
				if(line[i] >= 'A' && line[i] <= 'Z') {
					scra[line[i] - 'A']++;
				} else {
					blank++;
				}
			}
			aval = 0;
			for(i = 0; i < n; i++) {
				need = 0;
				for(j = 0; j < M_LEN; j++) {
					if(dic[i][j] > scra[j]) {
						need += dic[i][j] - scra[j];
					}
				}
				if(need <= blank) {
					aval++;
				}
			}
			printf("%d\n", aval);
		}
	}
}