Submission #1254613

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define print(x) cout<<x<<endl;
typedef long long ll;

int main() {
	int n,m;
	string a[52], b[52];
	int tmp=0,tmp_j=0;
	cin >> n >> m;
	int flag = 1;
	rep(i, 0, n)cin >> a[i];
	rep(i, 0, m)cin >> b[i];
	rep(i, 0, n) {
		rep(j, 0, n-m+1) {
			if (a[i].find(b[j]) >= 0) {
				tmp = a[i].find(b[j]);
				tmp_j = j;
				break;
			}
		}
		if (tmp < 0)continue;
		flag = 1;
		rep(k, tmp_j, m+ tmp_j) {
			if (tmp == a[i].find(b[k]))
				flag += 1;
		}
	}
	if(flag==m){print("YES") }
	else {print("NO") }
	return 0;
}

Submission Info

Judge Result