Submission #15050

#TimeUsernameProblemLanguageResultExecution timeMemory
15050myungwoo뚊 (kriii3_EE)C++14
20 / 20
0 ms1740 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...