1215. [S/W 문제해결 기본] 3일차 - 회문1 C++

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14QpAaAAwCFAYi 

SW Expert Academy

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>

using namespace std;

int n;
int cnt = 0;
void check(string st) {
    int j = n / 2;

    for (int i = 0; i < j; i++) {
        if (st[i] != st[(n-1) - i]) return;
    }

    cnt++;
}

int main() {
    
    int sun = 0;
    for (int i = 0; i < 10; i++) {
        cnt = 0;
        sun++;

        cin >> n;

        char arr[8][8];
        for (int i = 0; i < 8; i++)
            cin >> arr[i];

        string tmp;
        for (int i = 0; i < 8; i++) {
            for (int j = 0; j <= 8 - n; j++) {
                for (int x = j; x < j + n; x++) {
                    tmp += arr[i][x];                   
                }
                check(tmp);
                tmp.clear();
            }
        }

        for (int i = 0; i <= 8- n; i++) {
            for (int j = 0; j < 8; j++) {
                for (int x = i; x < i + n; x++) {
                    tmp += arr[x][j];
                }
                check(tmp);
                tmp.clear();
            }
        }

        cout << "#" << sun << " "<< cnt << endl;
    }
    
    return 0;
}