# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
469524 | Karabasan | Lozinke (COCI17_lozinke) | C++17 | 399 ms | 16600 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>
#define N 20005
using namespace std;
map<string,int> mp;
string s[N];
void solve(){
int n;
cin >> n;
int ans = 0;
for(int i=0;i<n;i++){
cin >> s[i];
mp[s[i]]++;
}
for(int i=0;i<n;i++){
set<string> st;
for(int j=0;j<s[i].size();j++){
string tmp = "";
for(int c = j;c<s[i].size();c++){
tmp += s[i][c];
st.insert(tmp);
}
}
for(auto u:st){
ans += mp[u];
}
}
cout << ans-n;
}
int main()
{
solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |