Submission #1368670

---

Source Code Expand

#include<iostream>
#include<set>
using namespace std;

int pow(int a, int b){
	if(b == 0) return 1;
	else if(b & 1) return a * pow(a, b - 1);
	else return pow(a * a, b / 2);
}

int main(){
	int n, m; cin >> n >> m;
	int ans = 0;
	set<int> s[n];
	for(int i = 0; i < m; ++i){
		int a, b; cin >> a >> b; --a; --b;
		s[a].insert(b);
		s[b].insert(a);
	}
	for(int i = 0; i < pow(2, n); ++i){
		bool party[n] = {0};
		int num = i;
		for(int j = 0; j < n; ++j){
			party[j] = num % 2;
			num /= 2;
		}
		bool jud = 1;
		for(int j = 0; j < n; ++j){
			for(int k = j + 1; k < n; ++k){
				if(party[j] && party[k] && s[j].find(k) == s[j].end()){
					jud = 0;
					break;
				}
			}
		}
		if(jud){
			int count = 0;
			for(int j = 0; j < n; ++j){
				count += party[j];
			}
			if(ans < count){
				ans = count;
			}
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result