Submission #159554

#TimeUsernameProblemLanguageResultExecution timeMemory
159554AKaan37Lozinke (COCI17_lozinke)C++17
5 / 100
1086 ms16248 KiB
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
 

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t;
int cev;
string s[li];
vector<int> v;

int main(void){
	fio();
	cin>>n;
	FOR{
		cin>>s[i];
	}
	FOR{
		for(int j=1;j<=n;j++){
			if(i==j)continue;
			int at=0;
			for(int jj=0;jj<(int)s[j].size();jj++){
				if(s[j][jj]==s[i][at])at++;
				else at=0;
				if(at==(int)s[i].size())break;
			}
			if(at==(int)s[i].size())cev++;
		}
	}
	cout<<cev<<endl;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...