Uva - 156 - Ananagrams
2015-06-11 18:25
375 查看
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 arelative 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.
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 #.
will always be at least one relative ananagram.
AC代码:
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 arelative 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 brokenacross 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. Therewill 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 drIed noel dire Disk mace Rob dries #
Sample output
Disk NotE derail drIed eye ladder soon
AC代码:
#include <iostream> #include <cstdio> #include <cstdlib> #include <cctype> #include <cstring> #include <string> #include <sstream> #include <vector> #include <set> #include <map> #include <algorithm> using namespace std; map<string, int> cnt; vector<string> words; string repr(const 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; } int main() { int n = 0; string s; while (cin >> s) { if (s[0] == '#') { break; } words.push_back(s); string r = repr(s); if (!cnt.count(r)) { cnt[r] = 0; } cnt[r]++; } vector<string> ans; for (int i = 0; i < words.size(); i++) { if (cnt[repr(words[i])] == 1) { ans.push_back(words[i]); } } sort(ans.begin(), ans.end()); for (int i = 0; i < ans.size(); i++) { cout << ans[i] << endl; } return 0; }
相关文章推荐
- 构造函数
- ASP.NET点击按钮弹出确认对话框方法
- How to install OpenResty
- OpenSIPS登录提示483 too many hoops处理
- 显示动画的基本属性
- Swift学习笔记十二
- c文件操作
- vijos 1104 采药
- “火狐每次打开都要进入 导入向导 界面”的解决方法
- ATX电源探究
- SQL Server索引 - 索引(物化)视图
- Centos6.5 搭建mysq主从复
- IOS学习之网络笔记
- vs调试C++程序时提示 系统找不到指定文件
- Jmeter笔记2:参数化(五种方法)
- 测试计划
- Windows 7下一个:该应用程序不能正常启动(0xc0150002)
- MySQL二进制安装常见问题处理
- 关于#ifdef _cplusplus extern "C"
- AMD, CommonJS, UMD?