2149.cpp

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

/*  This Code is Submitted by wywcgs for Problem 2149 on 2005-10-22 at 08:04:23 */ 
#include <cstdio>
#include <cstring>

const int MAX = 32;

void readln(int*);
inline int fabs(int);

int main()
{
	int N, i, j;
	int wordA[MAX], wordB[MAX];
	int total;
	
	scanf("%d", &N);
	getchar();
	for(i = 1; i <= N; i++) {
		memset(wordA, 0, sizeof(wordA));
		memset(wordB, 0, sizeof(wordB));
		total = 0;
		readln(wordA);
		readln(wordB);
		for(j = 0; j < MAX; j++) {
			total += fabs(wordA[j]-wordB[j]);
		}
		printf("Case #%d:  %d\n", i, total);
	}
	
	return 0;
}

void readln(int *w)
{
	int c;
	while((c = getchar()) != '\n') {
		w[c-'a']++;
	}
}
inline int fabs(int x)
{
	if(x >= 0) {
		return x;
	} else {
		return -x;
	}
}