# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472783 | AbdoMo | Lozinke (COCI17_lozinke) | C++17 | 1095 ms | 1484 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 int long long
#define ll long long
#define pb push_back
const int mod = 1e9+7;
using namespace std;
bool comp(string a,string b)
{
if(a.size()==b.size())
{
return a<b;
}
return a.size()<b.size();
}
void solve(){
int n;
cin>>n;
vector<string>v;
for(int i=0;i<n;i++)
{
string s;
cin>>s;
v.pb(s);
}
sort(v.begin(),v.end(),comp);
int ans=0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(v[i].size()==v[j].size())
{
if(v[i]==v[j])
ans+=2;
}
else
{
if(v[j].find(v[i])!=-1)
{
ans++;
}
}
}
}
cout<<ans<<endl;
/*
*/
}
int32_t main(){
int t=1;
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//cin>>t;
while(t--){solve();}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |