Submission #15161

#TimeUsernameProblemLanguageResultExecution timeMemory
15161BothEarRim뚊 (kriii3_EE)C++98
20 / 20
0 ms1720 KiB
#include <iostream> #include <sstream> #include <iomanip> #include <cstdio> #include <string> #include <cstring> #include <cstdlib> #include <cmath> #include <utility> #include <locale> #include <algorithm> #include <vector> #include <queue> #include <stack> #include <list> #include <set> #include <climits> #include <cfloat> #include <map> #include <functional> using namespace std; const double PI=acos(-1); int main() // 제3회 kriiicon { int r, c; char ipt[105][105], ipt2[105][105]; scanf("%d %d", &r, &c); for(int i=0; i<r; i++) scanf("%s", ipt[i]); for(int i=0; i<r; i++) scanf("%s", ipt2[i]); bool ans = true; for(int i=0; i<r && ans; i++) for(int j=0; j<c; j++) if(ipt[i][j] != ipt2[i][2*j] || ipt[i][j] != ipt2[i][2*j+1]) { ans = false; break; } printf("%sEyfa\n", ans? "":"Not "); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...