2503.txt

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

Memory:6108K  Time:656MS
Language:C++  Result:Accepted

Source 

#include <stdio.h>
#include <string.h>
#include <map>
using namespace std;

struct cmp
{
	bool operator()(char *a,char *b)const
	{
		return strcmp(a,b)<0;
	}
};

map< char *,char *,cmp > m;

char mem[100000][2][11];

int main()
{
	int i;
	char w[100],c;
	map<char *,char *,cmp>::iterator iter;
	
	i = 0;
	while(1)
	{
		scanf( "%s", mem[i][0] );
		scanf( "%s", mem[i][1] );

		m.insert( pair<char*,char*>( mem[i][1], mem[i][0] ) );
		getchar();

		if( ( c=getchar() ) == '\n' ) break;
		ungetc( c, stdin );
		i++;
	}

	while( scanf( "%s", w ) == 1 )
	{
		if( ( iter = m.find( w ) ) == m.end() )
			printf( "eh\n" );
		else printf( "%s\n", iter->second );
	}

	return 0;
}