Submission #1758152

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <string.h>
#include <iomanip>
using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
typedef long long ll;

int G[30][30];

int main() {

    int V,E,K; cin >> V >> E >> K;

    REP(i,E) {
        int a,b; cin >> a >> b;
        G[a][b] = 1;
        G[b][a] = 1;
    }

    REP(i, (1 << V)) {
        vector < int > ans;
        REP(j, V) if ((i >> j) & 1) {
            ans.push_back(j);
        }
        if (ans.size() != K) continue;
        REP(j,ans.size()) {
            REP(k,ans.size()) {
                if (G[ans[j]][ans[k]]) goto nxt;
            }
        }
        REP(j,ans.size()) cout << ans[j] << endl;
        return 0;
        nxt:;
    }

    return 0;
}

Submission Info

Judge Result