| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1309473 | ayuxhkumxr22 | Lozinke (COCI17_lozinke) | C++20 | 0 ms | 0 KiB |
/*
Author : ayuxh
*/
#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <C:\Users\AYUSH\Desktop\CP\Contest\debug.h>
#endif
#define INF (int)2e9
#define INFL (long long)2e18
#define int long long
const int mod = 998244353;
void Solve() {
int n;
cin>>n;
map<string,int> mp;
vector<string> v(n);
for(int i=0;i<n;i++){
cin>>v[i];
mp[v[i]]++;
}
int ans=0;
for(int k=0;k<n;k++){
set<string> s;
for(int i=0;i<v[k].size();i++){
for(int j=i;j<v[k].size();j++){
string str=v[k].substr(i,j-i+1);
if(s.find(str)==s.end()){
s.insert(str);
ans+=mp[str];
}
}
}
}
cout<<ans-n<<"\n";
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("inputf.in", "r", stdin);
freopen("outputf.out", "w", stdout);
#endif
int t=1;
// cin >> t;
while (t--) Solve();
return 0;
}