제출 #15134

#제출 시각아이디문제언어결과실행 시간메모리
15134skeksk91뚊 (kriii3_EE)C++98
20 / 20
0 ms1084 KiB
#include <stdio.h>
#include <string.h>

int main() {
	int n, m, f;
	char arr[12][12], arr2[30][30];
	scanf("%d%d", &n, &m);
	getchar();
	for (int i = 0; i < n; i++) {
		scanf("%s", arr[i]);
		getchar();
	}
	for (int i = 0; i < n; i++) {
		scanf("%s", arr2[i]);
		getchar();
	}
	f = 1;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (arr[i][j] != arr2[i][2 * j] || arr[i][j] != arr2[i][2 * j + 1]) {
				printf("Not Eyfa\n"); f = 0;
				break;
			}
		}
		if (f == 0) break;
	}
	if (f == 1) {
		printf("Eyfa");
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...