# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
15058 | | xhae | 뚊 (kriii3_EE) | C++14 | | 0 ms | 1720 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 <iostream>
#include <string>
using namespace std;
string orig[10], db[10];
int n, m;
int main(void) {
cin >> n >> m;
for(int i = 0; i < n; i++) cin >> orig[i];
for(int i = 0; i < n; i++) cin >> db[i];
bool isAns = true;
for(int i = 0; i < n; i++)
for(int j = 0; j < m * 2; j++)
if(orig[i][j / 2] != db[i][j])
isAns = false;
if(isAns) cout << "Eyfa\n";
else cout << "Not Eyfa\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |