3193.txt

来自「北大ACM题目例程 详细的解答过程 程序实现 算法分析」· 文本 代码 · 共 44 行

Source

Problem Id:3193  User Id:fzk 
Memory:180K  Time:230MS
Language:C++  Result:Accepted

Source 

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

using namespace std;

string str[1000];

int main( ) {
	int i, n, m, ans;
	char w[100];
	string word, *p;
	scanf( "%d%d", &n, &m );
	getchar( );
	for( i=0; i<n; i++ ) {
		gets( w );
		str[i] = w;
	}

	sort( str, str+n );

	ans = 0;
	while( m-- ) {
		gets( w );
		word = w;
		p = lower_bound( str, str+n, word );
		if( p != str+n && p->substr( 0, word.length() ) == word )
			ans++;
	}

	printf( "%d\n", ans );
	return 0;
}