题目
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
题意:
给定多个字符串,找出一些字符串——其任一排列在原文只出现过一次。
解题思路:
hash
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#define p 13
#define mod 1997 //一开始取997没过,后来取1997竟然A了,还是双hash稳一点
using namespace std;
string s[2003];
unsigned long long has[2003];
int id[124],num[2003]={0};
void init(){for(char zz='a';zz<='z';++zz)id[zz]=zz-'a'+1;}
int ha(string ss){ //字符串单hash
has[0]=id[ss[0]];
int t=ss.length();
for(int i=1;i<t;++i)has[i]=(has[i-1]*p+id[ss[i]])%mod;
return has[t-1];
}
int main(){
init();
string ss,sss;
while(cin>>ss){
if(ss[0]=='#')break;
sss=ss;
int len=ss.size();
for(int i=0;i<len;++i)if(ss[i]>='A'&&ss[i]<='Z')ss[i]+=32; //变小写
sort(ss.begin(),ss.end());
int tp=ha(ss);
s[tp]=sss;
num[tp]++;
}
set<string>sp;
for(int i=0;i<2002;++i)if(num[i]==1)sp.insert(s[i]); //仅出现一次
for(auto it=sp.begin();it!=sp.end();++it)puts((*it).c_str());
return 0;
}