#include <bits/stdc++.h>
using namespace std;
int n, ans;
string str[20005];
int main(){
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> str[i];
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if(i == j) continue;
int tmp = str[j].find(str[i]);
if(tmp != -1){
ans++;
}
}
}
cout << ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
844 KB |
Output is correct |
2 |
Correct |
1 ms |
920 KB |
Output is correct |
3 |
Correct |
1 ms |
844 KB |
Output is correct |
4 |
Correct |
5 ms |
844 KB |
Output is correct |
5 |
Correct |
17 ms |
844 KB |
Output is correct |
6 |
Correct |
42 ms |
844 KB |
Output is correct |
7 |
Correct |
62 ms |
912 KB |
Output is correct |
8 |
Correct |
48 ms |
916 KB |
Output is correct |
9 |
Execution timed out |
1086 ms |
936 KB |
Time limit exceeded |
10 |
Execution timed out |
1082 ms |
972 KB |
Time limit exceeded |
11 |
Execution timed out |
1069 ms |
964 KB |
Time limit exceeded |
12 |
Execution timed out |
1071 ms |
1032 KB |
Time limit exceeded |
13 |
Execution timed out |
1092 ms |
972 KB |
Time limit exceeded |
14 |
Execution timed out |
1089 ms |
972 KB |
Time limit exceeded |
15 |
Execution timed out |
1033 ms |
1020 KB |
Time limit exceeded |
16 |
Execution timed out |
1092 ms |
1100 KB |
Time limit exceeded |
17 |
Execution timed out |
1061 ms |
1100 KB |
Time limit exceeded |
18 |
Execution timed out |
1069 ms |
972 KB |
Time limit exceeded |
19 |
Execution timed out |
1067 ms |
1016 KB |
Time limit exceeded |
20 |
Execution timed out |
1087 ms |
972 KB |
Time limit exceeded |