UVa - 156 - Ananagrams(STL - 映射map)
来源:互联网 发布:java stringbuffer数组 编辑:程序博客网 时间:2024/05/22 05:17
Description
Most crossword puzzle fans are used to anagrams--groups of words with the same letters in different orders--for example OPTS, SPOT, STOP, POTS and POST. Some words however do not have this attribute, no matter how you rearrange their letters, you cannot form another word. Such words are called ananagrams, an example is QUIZ.
Obviously such definitions depend on the domain within which we are working; you might think that ATHENE is an ananagram, whereas any chemist would quickly produce ETHANE. One possible domain would be the entire English language, but this could lead to some problems. One could restrict the domain to, say, Music, in which case SCALE becomes a relative ananagram (LACES is not in the same domain) but NOTE is not since it can produce TONE.
Write a program that will read in the dictionary of a restricted domain and determine the relative ananagrams. Note that single letter words are, ipso facto, relative ananagrams since they cannot be ``rearranged'' at all. The dictionary will contain no more than 1000 words.
Input
Input will consist of a series of lines. No line will be more than 80 characters long, but may contain any number of words. Words consist of up to 20 upper and/or lower case letters, and will not be broken across lines. Spaces may appear freely around words, and at least one space separates multiple words on the same line. Note that words that contain the same letters but of differing case are considered to be anagrams of each other, thus tIeD and EdiT are anagrams. The file will be terminated by a line consisting of a single #.
Output
Output will consist of a series of lines. Each line will consist of a single word that is a relative ananagram in the input dictionary. Words must be output in lexicographic (case-sensitive) order. There will always be at least one relative ananagram.
Sample input
ladder came tape soon leader acme RIDE lone Dreis peat ScAlE orb eye Rides dealer NotE derail LaCeS drIednoel dire Disk mace Rob dries#
Sample output
DiskNotEderaildrIedeyeladdersoon
#include<cstdio>#include<iostream>#include<algorithm>#include<vector>#include<map>#include<string>using namespace std;int main(){//freopen("input.txt","r",stdin);string s;vector<string> v;//存放输入的单词 map<string,int> m;//用来记录标准化后的次数 string reper(string s);//将单词“标准化” while(cin>>s){if(s=="#")break;v.push_back(s);string temp = reper(s);if(m.count(temp)==0)m[temp]=0;//第一次出现,初始化数值 m[temp]++;}vector<string> out;for(int i=0 ;i<v.size() ;i++){if(m[reper(v[i])]==1)out.push_back(v[i]);}sort(out.begin(),out.end());for(int i=0 ;i<out.size() ;i++){cout<<out[i]<<endl;}return 0;}string reper(string s){string ans = s;for(int i=0 ;i<ans.length() ;i++){ans[i] = tolower(ans[i]);}sort(ans.begin(),ans.end());return ans;}
- UVa - 156 - Ananagrams(STL - 映射map)
- UVa-156 Ananagrams(map映射)
- UVa 156 Ananagrams(STL,map)
- UVa 156 Ananagrams(STL,map)
- UVa 156 Ananagrams 【STL】【map】
- UVA 156 Ananagrams(stl,map,set)
- UVa - 156 Ananagrams(STL)
- uva 156 Ananagrams STL
- UVa--156 Ananagrams (map)
- UVA 156 - Ananagrams (map)
- UVa-156-Ananagrams STL map容器的使用练习题
- UVa 156 - Ananagrams【各种stl】
- uva 156 Ananagrams STL处理
- UVA 156 Ananagrams map应用
- UVA 156 Ananagrams【map+set】
- 例题5-4 UVA 156 Ananagrams反片语(映射map)
- uva 156 Ananagrams(字符串+STL应用)
- UVA 156 Ananagrams(map,string的理解)
- Excel——if函数常用总结
- HTTP 状态响应码 意思详解/大全-续
- ubuntu nodejs 5.x
- MP4-4
- leetcode之70. Climbing Stairs(C++解法 动态规划思想)
- UVa - 156 - Ananagrams(STL - 映射map)
- 浅说静态链接和动态链接
- 验证码的识别tesseract
- oracle数据库中文乱码处理
- android中MpandroidChart柱状图
- CString 格式化 int型数据比如格式化数字8为L"08"的方法
- 高性能MySQL(第3版)
- HTML5 Web Audio Api-2 发声oscillator
- kafka的测试用例