Submission #145751

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
typedef vector<int> vec;

int main(){
	int n, m;
	cin >> n >> m;
	vector<vector<bool> > friends(n, vector<bool>(n, false));
	for( int i = 0; i < m; i++ ){
		int x, y;
		cin >> x >> y;
		friends[x-1][y-1] = true;
		friends[y-1][x-1] = true;
	}
	int ans = 0;
	for( int i = 0; i < (1<<n); i++ ){
		int count = 0;
		bool ok = true;
		for( int j = 0; j < n; j++ ){
			if( (i>>j)%2 == 0 ) continue;
			count++;
			for( int k = j+1; k < n; k++ ){
				if( (i>>k)%2 == 0 ) continue;
				if( !friends[j][k] ) ok = false;
			}
		}
		if( ok ) ans = max(ans, count);
	}
	cout << ans << endl;
}

Submission Info

Judge Result