UVa156.Ananagrams
8922 단어 uva
13913904
156
Ananagrams
Accepted
C++
0.009
2014-07-20 15:31:41
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 drIed
noel dire Disk mace Rob dries
#
Sample output
Disk
NotE
derail
drIed
eye
ladder
soon
: map , 。 , 。
1 #include <iostream>
2 #include <cstring>
3 #include <cstdlib>
4 #include <cctype>
5 #include <cstdio>
6 #include <algorithm>
7 #include <numeric>
8 #include <cmath>
9 #include <map>
10 #include <vector>
11 using namespace std;
12
13 map<string, int> cnt;
14 vector<string> words;
15
16 string cal_index(const string& s) {
17 string ans = s;
18 for (int i = 0 ; i < ans.size(); ++ i) {
19 ans[i] = tolower(ans[i]);
20 }
21 sort(ans.begin(), ans.end());
22 return ans;
23 }
24
25 int main () {
26 string str;
27 while (cin >> str) {
28 if (str == "#") {
29 break;
30 }
31 words.push_back(str);
32 string sort_str = cal_index(str);
33 if (!cnt.count(sort_str)) {
34 cnt[sort_str] = 0;
35 }
36 cnt[sort_str] ++;
37 }
38
39 vector<string> ans;
40 for (int i = 0 ; i < words.size(); ++ i) {
41 if (cnt[cal_index(words[i])] == 1) {
42 ans.push_back(words[i]);
43 }
44 }
45
46 sort(ans.begin(), ans.end());
47 for (int i = 0; i < ans.size(); ++ i) {
48 cout << ans[i] << endl;
49 }
50 return 0;
51 }
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
UVA - 10986 Sending email(Dijkstra 인접 테이블 + 우선 순위 대기열 최적화)제목 대의: s점에서 t점까지의 최소 거리를 구하는 그림을 주세요. 확인: 적나라한 최단길이지만 n이 너무 크면 인접 행렬을 사용할 수 없기 때문에 Dijkstra에 대한 인접표 + 우선 대기열 최적화가 필요합니다....
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.