# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151902 | phillip | Lozinke (COCI17_lozinke) | C++14 | 1086 ms | 2012 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;
bool cmp(string a,string b)
{
if(a.size()<b.size())return true;
return false;
}
int n;
string s[20009];
map<string,bool>m[20009];
int main()
{
cin>>n;
for(int i=0;i<n;i++)cin>>s[i];
sort(s,s+n,cmp);
int ans=0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
for(int k=0;k<s[j].size()-s[i].size()+1;k++)
{
if(s[j].substr(k,s[i].size())==s[i])
{
ans++;
//cout<<i<<" "<<j<<"\n";
break;
}
}
if(s[i]==s[j])ans++;//,cout<<j<<" "<<i<<"\n";
}
}
cout<<ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |