map使用方法 1004 HDU1113

题目大意：
In millions of newspapers across the United States there is a word game called Jumble. The object of this game is to solve a riddle, but in order to find the letters that appear in the answer it is necessary to unscramble four words. Your task is to write a program that can unscramble words.
The input contains four parts:

1. a dictionary, which consists of at least one and at most 100 words, one per line;
2. a line containing XXXXXX, which signals the end of the dictionary;
3. one or more scrambled `words' that you must unscramble, each on a line by itself; and
4. another line containing XXXXXX, which signals the end of the file.

All words, including both dictionary words and scrambled words, consist only of lowercase English letters and will be at least one and at most six characters long. (Note that the sentinel XXXXXX contains uppercase X's.) The dictionary is not necessarily in sorted order, but each word in the dictionary is unique.

For each scrambled word in the input, output an alphabetical list of all dictionary words that can be formed by rearranging the letters in the scrambled word. Each word in this list must appear on a line by itself. If the list is empty (because no dictionary words can be formed), output the line ``NOT A VALID WORD" instead. In either case, output a line containing six asterisks to signal the end of the list.

此题考查map的使用方法：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#include <algorithm>
using namespace std;
struct node
{
	string s[105];
	int pos;
}a[105];
int main()
{
	string s1,str;
	map<string,int>m;
	int i,cnt=0;
	for(i=0;i<105;i++)
	a[i].pos=0;
	while(cin>>s1&&s1!="XXXXXX")
	{
		str=s1;		//为了使原单词不变，多设置一个变量 
		sort(str.begin(),str.end());	//将其按字典序排序 
		if(m.find(str)!=m.end())		//本来有该字母组成 
		{
			int p=m[str];
			a[p].s[a[p].pos++]=s1; 		//多加入该字母组成的单词 
		}
		else
		{
			m[str]=cnt;				// 给改字母组成标号 
			a[cnt].s[a[cnt].pos++]=s1;	//将改类字母组成的单词加入 
			cnt++;
		}
	}
	while(cin>>s1&&s1!="XXXXXX")
	{
		int flag=0;
		sort(s1.begin(),s1.end());		//将其按字典序排序 
		if(m.find(s1)!=m.end())		//存在该字母组成 
		{
			int num=m[s1];
			flag=1;
			sort(a[num].s,a[num].s+a[num].pos);		//将由该字母组成的单词排序 
			for(i=0;i<a[num].pos;i++)
			{
				cout<<a[num].s[i]<<endl;	//按字典序顺序输出 
			}
		}
		if(flag==0)
		cout<<"NOT A VALID WORD"<<endl;
		cout<<"******"<<endl;
	}
return 0;
}