Submission #5020293

---

Source Code Expand

#include <stdio.h>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <iostream>
#include<math.h>
#include<bitset>
using namespace std;

int main() {
	int N, M,x,y, z[15][15] = { 0 };
	cin >> N >> M;
	for (int i = 0; i < M; i++) {
		cin >> x >> y;
		z[x- 1][y-1] = 1;
		z[y- 1][x - 1] = 1;
	}
	int ans = 1;
	for (int bit = 0; bit < (1 << N); bit++) {
		bool x = 1;
		int y = 0;
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < i; j++) {
				if (bit>>i&bit>>j&1&&i!=j) {
					if (z[i][j] == 0)x = 0; break;
				}
				
			}
		}

		if (x == 1) { 
			for (int c = 0; c < N; c++)y+= 1&(bit >> c);
			ans = max(y, ans); 
		}
	}
	cout << ans << endl;
}

Submission Info

Judge Result