2681.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

Problem Id:2681  User Id:fzk 
Memory:28K  Time:109MS
Language:C++  Result:Accepted

Source 

#include <stdio.h>
#include <algorithm>
#include <string.h>

using namespace std;

char w1[1010],w2[1010];

int main( )
{
	int n, i, j, k, l1, l2, t;

	scanf( "%d", &n );
	getchar();

	for( k=1; k<=n; k++ )
	{
		l1 = strlen( gets( w1 ) );
		l2 = strlen( gets( w2 ) );
		
		sort( w1, w1+l1 );
		sort( w2, w2+l2 );

		t = 0;
		for( i=0, j=0; i<l1&&j<l2;  )
		{
			if( w1[i] == w2[j] )
				t++, i++, j++;
			else if( w1[i] < w2[j] )
				i++;
			else
				j++;
		}
		
		printf( "Case #%d:  %d\n", k, l1+l2-t*2 );

	}
	return 0;
}