Submission #15041

#TimeUsernameProblemLanguageResultExecution timeMemory
15041hongjun7뚊 (kriii3_EE)C++98
20 / 20
0 ms1084 KiB
#include <cstdio>
int n, m;
char A[11][22], B[11][22];
int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) scanf("%s", A[i] + 1);
	for (int i = 1; i <= n; i++) scanf("%s", B[i] + 1);
	int res = 1;
	for (int i = 1; i <= n; i++) {
		int k = 1;
		for (int j = 1; j <= m; j++) {
			if (A[i][j] == B[i][k] && A[i][j] == B[i][k + 1])
				k += 2;
			else
				res = 0;
		}
	}
	puts(res ? "Eyfa" : "Not Eyfa");
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...