Submission #1104860

---

Source Code Expand

//Written by Zhu Zeqi
//Come on,baby
//Hack,please
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cwchar>
#include<cwctype>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int,int>
#define vi vector<int>
#define MAX 100000000000000000
#define MOD 1000000007
#define PI 3.141592653589793238462
#define INF 1000000000
typedef long long ll;
using namespace std;
//作者：中国江苏南京朱泽齐
int main(){
	//freopen("input.in","r",stdin);
	//freopen("output.out","w",stdout);
	char s1[55][55],s2[55][55];
	int n,m;
	bool flag=true;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cin>>s1[i][j];
		}
	}
	for(int i=1;i<=m;i++){
		for(int j=1;j<=m;j++){
			cin>>s2[i][j];
		}
	}
	int x1=1,y1=1,x2=1,y2=1;
	while(x1<=n && y1<=n && x2<=m && y2<=m){
		if(y1>n){
			y1=1;
			x1++;
			if(x1>n)
			break;
		}
		if(y2>m){
			y2=1;
			x2++;
			if(x2>m)
			break;
		}
		if(s1[x1][y1]!=s2[x2][y2]){
			flag=false;
		}
		y1++;
		y2++;
	}
	if(flag==false)
	cout<<"No"<<endl;
	else
	cout<<"Yes"<<endl;
	//system("pause");
	return 0;
}

Submission Info

Judge Result