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 <bits/stdc++.h>
using namespace std;
typedef long long lld;
int N, M;
char A[99][99], B[99][99];
int main()
{
scanf("%d%d", &N, &M);
for (int i=1;i<=N;i++) scanf("%s", A[i]);
for (int i=1;i<=N;i++) scanf("%s", B[i]);
for (int i=1;i<=N;i++){
for (int j=0;j<M+M;j++) if (B[i][j] != A[i][j/2]){
puts("Not Eyfa");
return 0;
}
}
puts("Eyfa");
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |