杭电ACM 1113的三种方法

Word Amalgamation

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 3491    Accepted Submission(s): 1707

Problem Description

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.

 

Input

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.

 

Output

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.

 

Sample Input

  
  

   
   tarp
given
score
refund
only
trap
work
earn
course
pepper
part
XXXXXX
resco
nfudre
aptr
sett
oresuc
XXXXXX
  
  

 

Sample Output

  
  

   
   score
******
refund
******
part
tarp
trap
******
NOT A VALID WORD
******
course
******
  
  

 

看完题目后，对map容器熟悉的同学可能就会选择用map来做这道题目了，当然如果你对map不怎么了解你也可以选择用两个容器或结构体来解决这个问题。

解题思路：首先用map<string,string>一个string保存排序前的，另一个保存排序后的。接着 词典上各个排好序的单词与要找的单词（排序后的）比较，如果相同，则输出之前词典上还未排序的单词。倘若在词典上找不到相同的话输出NOT A VALID WORD。此题要注意题目要求的输出格式。

方法一 ：运用map容器

#include<iostream>
#include<map>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
	string str,s,s1;
	bool flag;
	map<string,string> ma;
	map<string,string> ::iterator it;
	while(cin>>str && str != "XXXXXX")
	{
		s = str;
		sort(s.begin(),s.end());  
		ma.insert(pair<<span style="color:#cc0000;">string</span>,<span style="color:#ffcc00;">string</span>>(str,s));  //红色字体的用来存放排序前，黄色的用来保存排序后的
	}
	while(cin>>s1 && s1 != "XXXXXX")
	{
		flag = false;
		sort(s1.begin(),s1.end());
		for(it = ma.begin(); it != ma.end(); it++)
		{
			if(s1 == it->second) { flag = true;cout<<it->first<<endl; }
		}
		if(!flag){ cout<<"NOT A VALID WORD"<<endl; }
		cout<<"******"<<endl;
	}
	return 0;
}

方法二：使用两个容器

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
	string str,s;
	bool flag;
	vector<string> vec1,vec2;
	while(cin>>str && str != "XXXXXX")
	{
		vec1.push_back(str);     //排序前的str
		sort(str.begin(),str.end());		
		vec2.push_back(str);   //排序后的str

	}
	while(cin>>s && s != "XXXXXX")
	{
		flag = false;
		sort(s.begin(),s.end());
		for (int i = 0; i < vec2.size(); i++)
		{
			if(s == vec2[i]){ flag = true;cout<<vec1[i]<<endl; }
		}
		if(!flag){ cout<<"NOT A VALID WORD"<<endl;}
		cout<<"******"<<endl;
	}
	return 0;
}

方法三：使用结构体解决

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
struct MyStruct
{
	string str;  /<span style="font-family: Arial, Helvetica, sans-serif;">/用来保存排序前的str</span>
	string s;     /<span style="font-family: Arial, Helvetica, sans-serif;">/用来保存排序后的str</span><pre name="code" class="cpp">

};int main(){string str,s;int k = 0;bool flag;MyStruct mystruct[1000];while(cin>>str && str != "XXXXXX"){mystruct[k].str = str;sort(str.begin(),str.end());mystruct[k].s = str;k++;}while (cin>>s && s != "XXXXXX"){flag = false;sort(s.begin(),s.end());for (int i = 0; i < k; i++){if(s == mystruct[i].s){ flag = true;cout<<mystruct[i].str<<endl;}}if(!flag){ cout<<"NOT A VALID WORD"<<endl; }cout<<"******"<<endl;}return 0;}

注意：后面两种方式WA了，我看了蛮久也没有找到错误，也叫同学看了都觉得没错。如果你发现了错误告诉我一声噢！！！