# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
15145 | | ainu7 | 뚊 (kriii3_EE) | C++98 | | 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 <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <set>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<string> a(n), b(n);
for (int i=0; i<n; i++) cin >> a[i];
for (int i=0; i<n; i++) cin >> b[i];
bool same = true;
for (int i=0; i<n; i++)
for (int j=0; j<m; j++)
if (a[i][j] != b[i][j*2] || a[i][j] != b[i][j*2+1]) same = false;
if (same) cout << "Eyfa"; else cout << "Not Eyfa";
cout << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |