Submission #385724

---

Source Code Expand

// Template {{{
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
using namespace std;
typedef long long LL;

#ifdef LOCAL
#include "contest.h"
#else
#define dump(x) 
#endif

class range {
    struct Iterator {
        int val, inc;
        int operator*() {return val;}
        bool operator!=(Iterator& rhs) {return val < rhs.val;}
        void operator++() {val += inc;}
    };
    Iterator i, n;
    public:
    range(int e) : i({0, 1}), n({e, 1}) {}
    range(int b, int e) : i({b, 1}), n({e, 1}) {}
    range(int b, int e, int inc) : i({b, inc}), n({e, inc}) {}
    Iterator& begin() {return i;}
    Iterator& end() {return n;}
};

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
inline bool valid(int x, int w) { return 0 <= x && x < w; }

void iostream_init() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.setf(ios::fixed);
    cout.precision(12);
}
//}}}

int main(){
    iostream_init();
    int N, M;
    cin >> N >> M;
    int d[12][12] = {};
    REP(i, M) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        d[a][b] = d[b][a] = true;
    }

    int ans = 1;
    for(int s = 0; s < (1 << N); s++) {
        bool ok = true;
        REP(i, N) if(s >> i & 1) REP(j, N) if(s >> j & 1) {
            if(!d[i][j]) ok = false;
        }
        if(ok) ans = max(ans, __builtin_popcount(s));
    }
    cout << ans << endl;
    return 0;
}

/* vim:set foldmethod=marker: */

Submission Info

Judge Result