C++(코딩테스트) - 단체사진 찍기

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

using namespace std;

int solution(int n, vector<string> data) {
    int answer = 0;

    vector<char> KakaoFriends = { 'A', 'C', 'F', 'J', 'M', 'N', 'R', 'T' };

    do
    {
        bool check = false;
        int k_position[2];
        int k_distance;

        for (int j = 0; j < n; j++)
        {
            for (int i = 0; i < KakaoFriends.size(); i++)
            {
                if (KakaoFriends[i] == data[j][0]) k_position[0] = i;
                if (KakaoFriends[i] == data[j][2]) k_position[1] = i;
            }

            k_distance = abs(k_position[0] - k_position[1]) - 1;

            if (data[j][3] == '=')
            {
                if (k_distance == data[j][4] - '0') check = true;
                else check = false;
            }
            else if (data[j][3] == '>')
            {
                if (k_distance > data[j][4] - '0') check = true;
                else check = false;
            }
            else if (data[j][3] == '<')
            {
                if (k_distance < data[j][4] - '0') check = true;
                else check = false;
            }
            else
            {
                check = false;
            }
            if (!check) break;
        }
        if (check)
        {
            answer++;
        }

    } while (next_permutation(KakaoFriends.begin(), KakaoFriends.end()));

    return answer;
}