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