2019 카카오 코딩테스트 3번 : 후보키 (c++)

www.welcomekakao.com/learn/courses/30/lessons/42890

코딩테스트 연습 - 후보키

#include <iostream>
#include <string>
#include <vector>
#include <set>

using namespace std;

bool possi(vector<int> &vec,int now){
    for(int i=0;i<vec.size();i++){
        if((vec[i]&now)==vec[i])    return false;
    }
    return true;
}

int solution(vector<vector<string>> relation) {
    int answer;
    vector <int> ans;
    int n = relation.size();
    int m = relation[0].size();
    for(int i=1;i<(1<<m);i++){
        set <string> s;
        for(int j=0;j<n;j++){
            string now = "";
            for(int k=0;k<m;k++){
                if(i&(1<<k))now+=relation[j][k];
            }
            s.insert(now);
        }
        if(s.size()==n&&possi(ans,i)) ans.push_back(i);
    }
    answer=ans.size();
    return answer;
}