[BOJ] 14889번 스타트와 링크

#include 
#include 
#include 
#include 

using namespace std;

int board[20][20];

int main()
{

    memset(board,0,sizeof(board));

    int num;
    cin>>num;

    for(int i=0;i<num;i++){
        for(int j=0;j<num;j++){
            cin>>board[i][j];
        }
    }
/*
    for(int i=0;i<num;i++){
        for(int j=0;j<num;j++){
            cout<<board[i][j]<<" ";
        }
        cout<<endl;
    }
*/
    vector ind;
    for(int i=0;i<num;i++){
        if(i<num/2){
            ind.push_back(1);
        }else{
            ind.push_back(0);
        }
    }
/*
    for(int i=0;i<ind.size();i++){
        cout<<ind[i]<<" ";
    }
*/

    int minNum = 987654321;

    do{
        int teamA = 0;
        int teamB = 0;
        int mins =0;
        for(int i=0;i<num;i++){
            for(int j=0;j<num;j++){
                if(ind[i] == ind[j]){
                    if(ind[i] == 1){
                        teamA += board[i][j];
                    }else{
                        teamB += board[i][j];
                    }
                }
            }
        }
        if(teamA > teamB){
            mins = teamA - teamB;
        }else{
            mins = teamB - teamA;
        }
        minNum = min(minNum,mins);

    }while(prev_permutation(ind.begin(),ind.end()));


    cout<<minNum;

    return 0;
}

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

14889번: 스타트와 링크