# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472772 | SaraMostafa | Lozinke (COCI17_lozinke) | C++14 | 1098 ms | 2124 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>
#include<unordered_map>
using namespace std;
#define ll long long
#define endl "\n"
#define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const long long mod=998244353;
const double PI=acos(-1);
int main()
{
//freopen("input.in","r",stdin);
Sara
int n;
cin>>n;
vector<string>v(n);
map<string,ll>mp;
for(int i=0; i<n; i++)
{
cin>>v[i];
mp[v[i]]++;
}
ll cnt=0;
sort(v.begin(),v.end());
for(int i=0; i<n; i++)
{
vector<bool>vs(n);
vs[i]=1;
for(int k=0; k<v[i].size(); k++)
{
string c="";
for(int j=k; j<v[i].size(); j++)
{
c+=v[i][j];
for(int h=0; h<n; h++)
{
if(vs[h])
continue;
if(v[h]==c)
{
cnt++;
vs[h]=1;
}
}
}
}
vs.clear();
}
cout<<cnt<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |