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<cstdio>
char js[50][50];
char mag[50][50];
int main()
{
int N,M;
scanf("%d%d",&N,&M);
for(int i=0;i<N;i++) scanf("%s",js[i]);
for(int i=0;i<N;i++) scanf("%s",mag[i]);
for(int i=0;i<N;i++)
for(int j=0;j<2*M;j++)
{
if(mag[i][j]!=js[i][j/2])
{
puts("Not Eyfa");
return 0;
}
}
puts("Eyfa");
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |