Submission #15035

#TimeUsernameProblemLanguageResultExecution timeMemory
15035kipa00뚊 (kriii3_EE)C++98
20 / 20
0 ms1084 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...