题面:
代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<set>
#define ll long long
#define llu unsigned ll
using namespace std;
const int maxn=100100;
const int p=13331;
char str[maxn];
set<llu>se;
llu ha(void)
{
llu ans=0;
for(int i=0;str[i];i++)
ans=ans*p+str[i];
return ans;
}
int main(void)
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%s",str);
se.insert(ha());
}
cout<<se.size()<<endl;
return 0;
}