90求调

#include<bits/stdc++.h>
using namespace std;
int n;
priority_queue<long long> a;
string s;
long long check(string s){
    int sum;
    for(int i=0;i<s.length();i++){
        sum+=s[i];
        sum*=128;
    }
    return sum;
}
int main(){
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>s;
        a.push(check(s));
    }
    int ans=0;
    int _prev=-1;
    while(!a.empty()){
        if(a.top()!=_prev){
            ans++;
        }
        _prev=a.top();
        a.pop();
    }
    cout<<ans;
}

for(int i=0;i<s.length();i++){
    sum+=s[i]-32;
    sum*=96;
}