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 A[11][22], B[11][22];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%s", A[i] + 1);
for (int i = 1; i <= n; i++) scanf("%s", B[i] + 1);
int res = 1;
for (int i = 1; i <= n; i++) {
int k = 1;
for (int j = 1; j <= m; j++) {
if (A[i][j] == B[i][k] && A[i][j] == B[i][k + 1])
k += 2;
else
res = 0;
}
}
puts(res ? "Eyfa" : "Not Eyfa");
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |