算典05_例题_04_UVA-156

Ananagrams

题意

题解

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <map>

using namespace std;
const int maxn = 1e3 + 5;
const int INF = (1<<31)-1;
#define met(a, b) memset(a, b, sizeof(a));
#define IN freopen("in.txt", "r", stdin);
typedef long long LL;

string a, s[maxn], ss[maxn];
int sid;
map<string, int> m;
set<string> ans;

int main(){
#ifdef _LOCAL
IN;
#endif // _LOCAL

sid = 0;
while(cin >> a && a[0] != '#') {
s[sid] = a;
int len = a.size();
for(int i = 0; i < len; ++i) a[i] = tolower(a[i]);
sort(a.begin(), a.end());
ss[sid++] = a;
if(!m.count(a)) m[a] = 0;
++m[a];
}

for(int i = 0; i < sid; ++i) {
if(m[ss[i]] <= 1) ans.insert(s[i]);
}
for(set<string>::iterator it = ans.begin(); it!= ans.end(); ++it)
cout << (*it) <<endl;

return 0;
}