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 data[11][22];
char buf[22];
int main()
{
int n,m;
int i,j;
scanf("%d%d",&n,&m);
for(i=0;i<n;++i) scanf("%s",data+i);
bool nodab = false;
for(i=0;i<n;++i){
scanf("%s",buf);
for(j=0;j<2*m;++j){
if(data[i][j/2]!=buf[j]) nodab=true;
}
}
if(nodab) printf("Not "); puts("Eyfa");
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |