# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165780 | muhi1112 | Lozinke (COCI17_lozinke) | C++17 | 210 ms | 15256 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;
#define endl '\n'
#define f1 first
#define s2 second
#define pb push_back
#define mp make_pair
#define ll long long
#define fri(a) freopen(a,"r",stdin);
#define fro(a) freopen(a,"w",stdout);
const int N=405;
int n,ans;
string s;
vector<string>str;
unordered_set<string>sety;
unordered_map<string,int>cnt;
int main(){
//fri("in.txt");
//fro("out.txt");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for(int i=0;i<n;i++){
cin>>s;
cnt[s]++;
str.pb(s);
//sety.insert(s);
}
for(int i=0;i<n;i++){
for(int j=0;j<str[i].length();j++){
for(int p=1;p+j<=str[i].length();p++){
string s1 (str[i],j,p);
if(cnt[s1]>1 && s1==str[i])ans+=cnt[s1]-1;
else if(s1!=str[i])ans+=cnt[s1];
}
}
}
cout<<ans<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |