#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define f1 first
#define s2 second
#define pb push_back
#define mp make_pair
#define ll long long
#define fri(a) freopen(a,"r",stdin);
#define fro(a) freopen(a,"w",stdout);
const int N=405;
int n,ans;
string s;
vector<string>str;
unordered_set<string>sety;
unordered_map<string,int>cnt;
int main(){
//fri("in.txt");
//fro("out.txt");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for(int i=0;i<n;i++){
cin>>s;
cnt[s]++;
str.pb(s);
//sety.insert(s);
}
for(int i=0;i<n;i++){
for(int j=0;j<str[i].length();j++){
for(int p=1;p+j<=str[i].length();p++){
string s1 (str[i],j,p);
if(cnt[s1]>1 && s1==str[i])ans+=cnt[s1]-1;
else if(s1!=str[i])ans+=cnt[s1];
}
}
}
cout<<ans<<endl;
return 0;
}
Compilation message
lozinke.cpp: In function 'int main()':
lozinke.cpp:33:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=0;j<str[i].length();j++){
~^~~~~~~~~~~~~~~~
lozinke.cpp:34:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int p=1;p+j<=str[i].length();p++){
~~~^~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
4 |
Incorrect |
3 ms |
376 KB |
Output isn't correct |
5 |
Incorrect |
5 ms |
760 KB |
Output isn't correct |
6 |
Incorrect |
8 ms |
760 KB |
Output isn't correct |
7 |
Incorrect |
12 ms |
1528 KB |
Output isn't correct |
8 |
Correct |
16 ms |
2168 KB |
Output is correct |
9 |
Incorrect |
35 ms |
2412 KB |
Output isn't correct |
10 |
Correct |
80 ms |
7120 KB |
Output is correct |
11 |
Incorrect |
56 ms |
4080 KB |
Output isn't correct |
12 |
Correct |
192 ms |
15236 KB |
Output is correct |
13 |
Incorrect |
88 ms |
2796 KB |
Output isn't correct |
14 |
Incorrect |
134 ms |
13984 KB |
Output isn't correct |
15 |
Correct |
210 ms |
15256 KB |
Output is correct |
16 |
Incorrect |
87 ms |
1856 KB |
Output isn't correct |
17 |
Correct |
97 ms |
1780 KB |
Output is correct |
18 |
Incorrect |
67 ms |
1644 KB |
Output isn't correct |
19 |
Incorrect |
122 ms |
8040 KB |
Output isn't correct |
20 |
Incorrect |
51 ms |
1728 KB |
Output isn't correct |