Submission #1592526

---

Source Code Expand

#include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<vector>

using namespace std;

int main() {
	int i, j, k, t, N, M;
	char A[51][51], B[51][51];

	cin >> N >> M;

	for (i = 0; i < N; i++) {
		for (j = 0; j < N; j++) {
			cin >> A[i][j];
		}
	}

	for (i = 0; i < M; i++) {
		for (j = 0; j < M; j++) {
			cin >> B[i][j];
		}
	}

	int flag;
	//cout << endl;
	for (i = 0; i < N; i++) {
		for (j = 0; j < N; j++) {
			//cout<< A[i][j];
			flag = 0;
			for (k = i; k < M+i; k++) {
				if (k > 49) {
					flag = 1;
					break;
				}
				for (t = j; t < M+j; t++) {
					//cout << B[k][t];
					if (t > 49) {
						flag = 1;
						break;
					}
					if (B[k][t] != A[k][t]) {
						flag = 1;
						break;
					}
				}
				if (flag == 1) break;
				//cout << endl;
			}
			if (flag == 0) {
				cout << "Yes" << endl;
				
			
				return 0;
			}
		}
		//cout << endl;
	}

	cout << "No" << endl;


	/*
	for (i = 0; i < M; i++) {
		for (j = 0; j < M; j++) {
			cout<< B[i][j];
		}
		cout << endl;
	}
	*/









	return 0;
}

Submission Info

Judge Result