알고리즘
[C++] 백준 11383번: 뚊
mezo
2019. 9. 10. 01:48
728x90
반응형
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<string> v;
int main(void) {
int M, N;
cin >> N >> M;
bool eyfa = true;
v.resize(2*N);
for (int i = 0; i < 2 * N; i++)
cin >> v[i];
for (int i = 0; i < N; i++) {
int k = 0;
for (int j = 0; j < M; j++) {
if (v[i][j] == v[i + N][j + k] && v[i][j] == v[i + N][j + k + 1]) {
k++;
}
else {
eyfa = false;
break;
}
}
if (!eyfa)
break;
}
if (!eyfa)
cout << "Not Eyfa" << endl;
else
cout << "Eyfa" << endl;
return 0;
}
728x90
반응형