哈希

奇怪的姿势hhh

#include<cstdio> 
#include<cstring>
#include<cmath>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<queue>
#include<set>
#define maxint (2147483647)
#define l(a) ((a)<<1)
#define r(a) ((a)<<1|1)
#define b(a) (1<<(a))
#define mod1 (10000007)
#define mod2 (10000009)
#define rep(i,a,b) for(int i=a;i<=(b);i++)
#define clr(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int readint(){
    int t=0,f=1;char c=getchar();
    while(!isdigit(c)){
        if(c=='-') f=-1;
        c=getchar();
    }
    while(isdigit(c)){
        t=(t<<3)+(t<<1)+c-'0';
        c=getchar();
    }
    return t*f;
}
const int maxn=10009,maxm=1509;
int n;
char s[maxn][maxm];
int d1[maxn],d2[maxn];
ull d3[maxn];
int main(){
    //freopen("#input.txt","r",stdin);
    //freopen("#output.txt","w",stdout);
    n=readint();
    rep(i,1,n) scanf("%s",s[i]);
    rep(i,1,n){
        rep(j,0,strlen(s[i])-1){
            d1[i]=((d1[i]*107)%mod1+s[i][j])%mod1;
            d2[i]=((d2[i]*107)%mod2+s[i][j])%mod2;
            d3[i]=d3[i]*107ull+s[i][j];
        }
    }
    int ans=-maxint;
    sort(d1+1,d1+n+1);ans=max(ans,int(unique(d1,d1+n+1)-d1-1));
    sort(d2+1,d2+n+1);ans=max(ans,int(unique(d2,d2+n+1)-d2-1));
    sort(d3+1,d3+n+1);ans=max(ans,int(unique(d3,d3+n+1)-d3-1));
    cout<<ans<<endl;
    //fclose(stdin);
    //fclose(stdout);
    return 0;
}