백준 11383번: 똚

https://www.acmicpc.net/problem/11383

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
#define c_reverse(s) reverse(s.begin(), s.end())
#define c_sort(s) sort(s.begin(), s.end())
 
#define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i];
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    int n, m; cin >> n >> m;
    cin.ignore();
 
    int cand = n;
 
 
    vector<string> arr;
    while(cand--) {
        string s; cin >> s;
        arr.push_back(s);
    }
 
    bool isOk = true;
    for (int i=0; i<n; i++)
    {
        string s; cin >> s;
        string s2;
 
        const int size = arr[i].size();
        string d = arr[i];
        for (int j=0; j<size; j++) {
            s2.push_back(d[j]);
            s2.push_back(d[j]);
        }
 
        if (s2 != s) {
            isOk = false;
        }
    }
 
    if (isOk) {
        cout << "Eyfa" << CENDL;
    } else {
        cout << "Not Eyfa" << CENDL;
    }
 
    return 0; 
}