#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
using namespace std;
char a[10005];
int n,m,k;
long long base;
long long ans;
long long num[10005];
int main(){
freopen("3370.in","r",stdin);
freopen("3370.out","w",stdout);
scanf("%d",&n);
k=n;ans=0;base=131;
for(int i=1;i<=n;i++){
scanf("%s",&a);
m=strlen(a);
for(int j=0;j<m;j++){
num[i]=(num[i]*base+a[j])%212370440130137957;
}
}
/* for(int i=1;i<=k;i++){
printf("%lld\n",num[i]);
}*/
sort(num+1,num+1+k);
ans=1;
for(int i=2;i<=k;i++){
if(num[i]!=num[i-1]){
ans++;
}
}
printf("%lld\n",ans);
return 0;
}
Hash(c++)
最新推荐文章于 2024-09-08 22:16:37 发布