Submission #121856

---

Source Code Expand

#include <iostream>
#include <string>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;

#define MAX 12

int main(int argc, char const* argv[])
{
	int n,m;
	cin >> n >> m;

	int s[MAX][MAX] = {};
	int res = 1;

	for (int i = 0; i < m; i++) {
		int x,y;
		cin >> x >> y;
		s[x - 1][y - 1] = 1;
	}

	for (int i = 0; i < (1 << n); i++) {
		vector <int> tmp;
		for (int j = 0; j < n; j++) {
			if ( (i >> j) & 1) {
				tmp.push_back(j);
			}
		}
		int flag = 1;
		for (int j = 0; j < tmp.size(); j++) {
			for (int k = j + 1; k < tmp.size(); k++) {
				if (s[tmp[j]][tmp[k]] != 1) {
					flag = 0;
				}	
			}
		}
		if (flag == 1 && tmp.size() > res) {
			res = tmp.size();
		}
	}
	cout << res << endl;

	return 0;
}

Submission Info

Judge Result