63 TLE求调

#include<bits/stdc++.h>
#define ll long long
#define INF 1e18

using namespace std;
const ll mod1 = 1e9 + 7, mod2 = 1e9 + 9;
ll n;
set<ll> vis;
ll f(ll a, ll b, ll mod){
	ll res = 1;
	while(b){
		if(b & 1) res = res * a % mod;
		a = a * a % mod;
		b = b >> 1;
	}
	return res;
}
ll hsh(string s) {
	ll cnt = 0;
	ll cnt1 = 0;
	ll p = 0;
	for(ll i = s.size() - 1; i >= 0; i--){
		ll a = (ll)s[i];
	    ll t = f(a, p, mod1);
	    ll t1 = f(a, p, mod2);
	    p++;
		cnt = (t + cnt) % mod1; 
		cnt1 = (t + cnt1) % mod2;
	}
	return cnt + cnt1;
}
int main(){
    cin >> n;
    ll count = 0;
    while(n--){
    	string s;
    	cin >> s;
    	ll ans = hsh(s);
    	if(!vis.count(ans)) {
    		vis.insert(ans);
    		count++;
		}
	}
	cout << count << endl;
	return 0;
}