# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116840 | gaoxam123 | Lozinke (COCI17_lozinke) | C++14 | 310 ms | 15272 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int n;
string l[20005];
unordered_set<string> s;
unordered_map<string, int> m;
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>l[i];
s.clear();
for(int j=0;j<l[i].size();j++){
string a;
for(int k=j;k<l[i].size();k++){
a.push_back(l[i][k]);
s.insert(a);
}
}
for(auto &x:s)
m[x]++;
}
int ans=0;
for(auto &x:l)
ans+=m[x];
cout<<ans-n;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |