제출 #15110

#제출 시각아이디문제언어결과실행 시간메모리
15110cki86201뚊 (kriii3_EE)C++98
20 / 20
0 ms1084 KiB
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
char p[12][12], q[12][24];
bool F;
int main(){
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; i++)scanf("%s", p[i]);
	for (int i = 0; i < n; i++)scanf("%s", q[i]);
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m + m; j++){
			if (q[i][j] != p[i][j / 2])F = 1;
		}
	}
	printf("%s", F ? "Not Eyfa" : "Eyfa");
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...