ACM反片语

#include<iostream>
#include<string>
#include<cctype>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;

map<string,int>cnt;
vector<string>words;

//将单词s进行“标准化”
string repr(const string &s)
{
string ans=s;
for(int i=0;i<ans.length();i++)
{
ans[i]=towlower(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;
}

转载于:https://www.cnblogs.com/code666/p/6772607.html