1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
| #include <iostream>
#include <algorithm>
#include <queue>
#include <string.h>
#include <cstdio>
using namespace std;
const int mod = 192608173;
const int base = 233;
int hsh(string s)
{
int ans = 0;
int len = s.size();
for(int i=0; i<len; i++)
{
ans = (ans*base+(int)s[i])%mod;
}
return ans;
}
int n;
string s[10005];
int num[10005];
int main()
{
cin >> n;
for(int i=1; i<=n; i++)
{
cin >> s[i];
num[i] = hsh(s[i]);
}
sort(num+1,num+1+n);
int ans = 0;
for(int i=2; i<=n; i++)
{
if(num[i] != num[i-1]) ans++;
}
cout << ans+1;
return 0;
}
|