2142358_ac_0ms_56k.cpp

北大大牛代码 1240道题的原代码 超级权威

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

struct node
{
	char word[100];
}dic[101];

bool cmp(struct node a,struct node b)
{
	return strcmp(a.word,b.word)<0;
}

void input()
{
	int i, j;
	char tmp[100], t[100];

	i = 0;
	while(scanf("%s",tmp)==1&&strcmp(tmp,"XXXXXX")!=0)
		strcpy(dic[i++].word,tmp);
	std::sort(dic,dic+i,cmp);
	bool mark;
	while(scanf("%s",tmp)==1&&strcmp(tmp,"XXXXXX")!=0)
	{
		mark = 1;
		std::sort(tmp,tmp+strlen(tmp));
		for(j = 0; j < i; j++)
		{
			strcpy(t,dic[j].word);
			std::sort(t,t+strlen(t));
			if(strcmp(t,tmp)==0)
			{
				mark = 0;
				puts(dic[j].word);
			}
		}
		if(mark)
			puts("NOT A VALID WORD");
		puts("******");
	}
}

int main()
{
	input();
	return 1;
}