萌新刚学哈希1ms%998244353fs，54pts求条

#include<bits/stdc++.h>
using namespace std;
const int mod=29811;
unsigned long long key[30001];
bool vis[30001]; 
void solve(string s){//x->y 相当于一个对应关系
	int len=s.length();
	unsigned long long x=0;
	for(int i=0;i<len;i++){
		int c=int(s[i]);
		x+=c*(i+1)*131;
	}
	unsigned long long h1=x%mod,h2=1+(x%(mod-1)),k=0;
	unsigned long long pos=(h1+k*h2)%mod;
	while(vis[pos]){
		pos=(h1+k*h2)%mod;
		if(key[pos]==x){
			return;
		}
		k++;
	}
	key[pos]=x;
	vis[pos]=1;
	return;
}
int main(){
	int n,res=0;
	cin>>n;
	for(int i=1;i<=n;i++){
		string ls;
		cin>>ls;
		solve(ls);
	}
	for(int i=0;i<=30001;i++){
		if(key[i]) res++;
	}
	cout<<res;
	return 0;
}