# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
15035 | | kipa00 | 뚊 (kriii3_EE) | C++98 | | 0 ms | 1084 KiB |
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>
#include <algorithm>
#include <cstring>
using namespace std;
char a[10][11], b[10][21];
int main() {
int N, M, i, j;
scanf("%d%d", &N, &M);
for (i=0; i<N; ++i) {
scanf("%s", a[i]);
}
for (i=0; i<N; ++i) {
scanf("%s", b[i]);
}
for (i=0; i<N; ++i) {
for (j=0; j<2 * M; ++j) {
if (a[i][j / 2] != b[i][j]) {
printf("Not Eyfa\n");
return 0;
}
}
}
puts("Eyfa");
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |