This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
int N,M;
char A[100][100],B[100][100];
int main(){
scanf("%d%d",&N,&M);
for(int i=0;i<N;i++)scanf("%s",A[i]);
for(int i=0;i<N;i++)scanf("%s",B[i]);
int ans=1;
for(int i=0;i<N;i++)for(int j=0;j<2*M;j++)if(B[i][j]!=A[i][j/2])ans=0;
puts(ans?"Eyfa":"Not Eyfa");
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |