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;
int main()
{
string a[10], b[10];
int n, m;
bool eyfa = true;
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < 2*m; j++)
{
if (a[i][j / 2] != b[i][j])
{
eyfa = false;
break;
}
}
if (eyfa == false)
break;
}
if (eyfa == false)
cout << "Not Eyfa" << endl;
else
cout << "Eyfa" << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |