Submission #928049

#TimeUsernameProblemLanguageResultExecution timeMemory
928049xadLozinke (COCI17_lozinke)C++14
40 / 100
1090 ms1116 KiB
#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> #define nn "\n" #define x_x ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define intt int _; cin >> _; while (_--) #define emp push_back #define mod 1000000007 #define all(v) v.begin(), v.end() #define ld long double #define A first #define B second typedef long long ll; const ld eps = 1e-27; // diff between decimals 0.000000001 mt19937 mt(time(nullptr)); int fx[]={1,-1,0,0}, fy[]={0,0,1,-1}; int main() { /*freopen("measurement.in","r",stdin); freopen("measurement.out","w", stdout);*/ x_x int n; cin>>n; string ar[n]; for (auto&i:ar) cin>>i; ll ans=0; for (int i=0; i<n; i++ ){ for (int j=0; j<n; j++) { if (i==j)continue; for (int k=0; (k+ar[i].size())<=ar[j].size(); k++) { if (ar[j].substr(k,ar[i].size())==ar[i]){ans++; break;} } } } cout<<ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...