# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078666 | khactrung1912 | Lozinke (COCI17_lozinke) | C++14 | 1072 ms | 1084 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;
int n, ans;
string st[20004];
bool check(string x, string y)
{
if (y.find(x)!=-1) return true;
return false;
}
void sub1()
{
ans = 0;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
if (i!=j && st[j].size()>=st[i].size() && check(st[i],st[j])) ans++;
cout << ans;
}
void sub2()
{
ans = 0;
for (int i=1; i<n; i++)
for (int j=i+1; j<=n; j++)
{
if (st[i].size()>=st[j].size() && check(st[j],st[i])) ans++;
if (st[j].size()>=st[i].size() && check(st[i],st[j])) ans++;
}
cout << ans;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen("PASS.INP","r",stdin);
//freopen("PASS.OUT","w",stdout);
cin >> n;
for (int i=1; i<=n; i++) cin >> st[i];
if (n<=1000) sub1(); else sub2();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |