UVa 156 Ananagrams(STL,map)
来源:互联网 发布:淘宝宝贝被管控怎么办 编辑:程序博客网 时间:2024/05/05 09:14
Ananagrams
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
题意 给你一篇文章 以"#"号结束 按字典序求输出这篇文章中真正只出现过一次的单词 就是不能通过字母重新排列得到文章中另一个单词的单词
把每个单词的字母全部化为小写 再把这个单词中的字母按字典序排列 得到一个字符串 用map记下出现次数就行 只出现过一次的就是要输出的
#include<iostream>#include<algorithm>#include<string>#include<vector>#include<cctype>#include<map>using namespace std;typedef vector<string>::iterator it;vector<string> ans;map<string, int> cnt, tcnt;map<string, string> ss;int main(){ string s, t; while (cin >> s, s != "#") { t = s; ans.push_back (s); for (int j = 0; j < t.length(); ++j) t[j] = tolower (t[j]); sort (t.begin(), t.end()); ss[s] = t; ++cnt[t]; } sort (ans.begin(), ans.end()); for (it i = ans.begin(); i < ans.end(); ++i) if (cnt[ss[*i]] == 1) cout << *i << endl; return 0;}
- UVa 156 Ananagrams(STL,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应用
- UVA 156 Ananagrams【map+set】
- uva 156 Ananagrams(字符串+STL应用)
- UVA 156 Ananagrams(map,string的理解)
- UVA 156 Ananagrams(map、set)
- Java字节码框架ASM-读写字节码的用法
- @RequestMapping 用法详解之地址映射(入门篇)
- mser处理文本区域
- Oracle数据导出遇到的问题及解决的办法
- Storm详解一、Storm 概述
- UVa 156 Ananagrams(STL,map)
- sgu 114解题记录
- 安装时提示 INSTALL_PARSE_FAILED_MANIFEST_MALFORMED 解决办法
- php解析mht文件转换成html
- 理解 Thread.Sleep 函数
- Uva 10465 — Homer Simpson
- ios7版本适配问题总结(一)
- qt 之单元测试
- 曾经的曾经