# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152484 | PedroBigMan | Lozinke (COCI17_lozinke) | C++14 | 1089 ms | 1524 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 <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
ll N; vector<string> str; string s,t; bool eq;
ll Check(ll a, ll b)
{
if(a==b){return 0;}
s=str[a]; t=str[b];
REP(i,0,t.size()-s.size()+1)
{
eq=true;
REP(j,i,i+s.size()) {if(t[j]!=s[j-i]) {eq=false;}}
if(eq){return 1;}
}
return 0;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>N; REP(i,0,N) {str.pb("");}
REP(i,0,N) {cin>>str[i];}
ll ans=0;
REP(i,0,N)
{
REP(j,0,N)
{
ans+=Check(i,j);
}
}
cout<<ans<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |