P3370 字符串哈希

传送门

accode:

#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
const ull seed = 13131313131;
const int maxn = 1e6 + 10;
ull a[maxn];
char s[maxn];
int n, ans = 1;
int prime = 2333317;
ull mod = 212370440130137957ll;

ull hashh(char s[])
{
	int len = strlen(s+1);
	ull ans = 0;
	for(int i = 0; i < len; i++)
	{
		ans = (ans * seed + (ull)s[i] ) % mod + prime;
	} 
	return ans;
}

int main()
{
	int n;
	scanf("%d",&n);
	for(int i = 1; i <= n; i++)
	{
		cin>>s+1;
		a[i] = hashh(s);
	}	
	sort(a+1,a+n+1);
	for(int i = 1; i < n; i++)
	{
		if(a[i] != a[i+1])
			ans++;
	}
	printf("%d\n",ans);
	
	return 0;
}