91分求调
查看原帖
91分求调
1461559
_Passer楼主2025/7/22 10:50
#include <bits/stdc++.h>
using namespace std;
const int base = 13331, mod = 1e9 + 7;
typedef long long ll;
const int MAXN = 1e6 + 3;
ll H[MAXN];
set<int> N;
ll h(string a) {
	ll n = a.length();
	for(int i = 1;i <= n;++i) {
		H[i] = (H[i - 1] * base + a[i - 1]) % mod; 
	}
	return H[n] % mod;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n;
	cin>>n;
	for(int i = 0;i < n;++i) {
		string a;
		cin>>a;
		N.insert(h(a));
	}
	cout<<N.size()<<"\n";
	return 0;
}
2025/7/22 10:50
加载中...