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>
int n, m;
char str[30][30];
char str2[30][30];
int main(){
scanf("%d %d",&n,&m);
for(int i=0; i<n; i++){
scanf("%s",str[i]);
}
for(int i=0; i<n; i++){
scanf("%s",str2[i]);
for(int j=0; j<m; j++){
if(str2[i][2*j] != str2[i][2*j+1]){
puts("Not Eyfa");
return 0;
}
if(str2[i][2*j] != str[i][j]){
puts("Not Eyfa");
return 0;
}
}
}
puts("Eyfa");
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |