82求条

#include<bits/stdc++.h>
using namespace std;
const long long MOD = 10000019;
long long tong[MOD]; 
long long qpow(long long a, long long b)
{
    long long res = 1;
    a %= MOD;  
    while(b) 
    {
        if(b & 1) res = res * a % MOD;
        a = a * a % MOD;
        b = b >> 1;
    }
    return res;
}
int main() 
{
    long long n;
    cin >> n;
    long long sum = 0;
    for(long long i = 1; i <= n; i++) 
    {
        string s;
        cin >> s;
        long long len = s.size();
        long long ans = 0;
        for(long long j = 0; j < len; j++) 
        {
            ans = (ans * 128 + (long long)(s[j])) % MOD;
        }
        tong[ans]++;
        if(tong[ans] == 1) 
        {  
            sum++;
        }
    }
    cout << sum << endl;
    return 0;
}