| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1077355 | komasan | Lozinke (COCI17_lozinke) | C++14 | 1089 ms | 1056 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 <bits/stdc++.h>
using namespace std;
const int N = 2e4 + 5;
string a[N];
bool check(string &x, string &y){
	int l = 0, r = 0;
	int n = x.size(), m = y.size();
	while (l < n && r < m){
		if (x[l] == y[r]){
			l++;
			r++;
		}
		else r++;
	}
	return l == n;
}
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n; cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i];
	int ans = 0;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			if (i != j) ans += check(a[j], a[i]);
	cout << ans;
	return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
