제출 #15029

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

int main(){
	int N, M;
	while(~scanf("%d %d", &N, &M)){
		char I1[10][10];
		char I2[10][20];
		for(int i = 0; i < N; i++)
			for(int j = 0; j < M; j++)
				scanf(" %c", &I1[i][j]);
		for(int i = 0; i < N; i++)
			for(int j = 0; j < 2 * M; j++)
				scanf(" %c", &I2[i][j]);
		for(int i = 0; i < N; i++){
			for(int j = 0; j < M; j++){
				if(I1[i][j] != I2[i][j * 2] || I1[i][j] != I2[i][j * 2 + 1]){
					printf("Not ");
					goto end;
				}
			}
		}
	end:
		printf("Eyfa\n");
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...