# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
170324 | ngmh | Lozinke (COCI17_lozinke) | C++11 | 306 ms | 15420 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;
long long n, c;
string s[20000], t;
unordered_map<string, long long> ori;
set<string> sub;
int main(){
cin >> n;
for(int i = 0; i < n; i++){
cin >> s[i];
if(ori.count(s[i]) == 0) ori[s[i]] = 1;
else ori[s[i]]++;
}
for(int i = 0; i < n; i++){
for(int j = 0; j < s[i].size(); j++){
t = "";
for(int k = j; k < s[i].size(); k++){
t += s[i][k];
sub.insert(t);
}
}
for(auto it: sub){
c += ori[it];
}
c--;
sub.clear();
}
cout << c;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |