二次hash字符串

#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#define LL long long
using namespace std;
const LL D1=131;
const LL D2=131;
const LL MOD1=1e9+7;
const LL MOD2=1e9+9; 
char ss[10010];
struct node{
    LL hash1,hash2;
}a[10011];
LL make_hash1(char s[])
{
    LL ans=0;
    for(int i=0;i<strlen(s);i++)
     ans=(ans*D1+(LL)(s[i]))%MOD1;
    return ans; 
}
LL make_hash2(char s[])
{
    LL ans=0;
    for(int i=0;i<strlen(s);i++)
     ans=(ans*D2+(LL)(s[i]))%MOD2;
    return ans; 
}
bool comp(const node&a,const node&b)
{
    return a.hash1<b.hash1;
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
     scanf("%s",ss),a[i].hash1=make_hash1(ss),a[i].hash2=make_hash2(ss);

    sort(a+1,a+n+1,comp);
    int ans=1;
    for(int i=2;i<=n;i++)
     if(a[i].hash1!=a[i-1].hash1||a[i].hash2!=a[i-1].hash2) ans++;
    printf("%d",ans);
    return 0; 
}