Submission #1772432

---

Source Code Expand

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

int main()
{
  int N, M;
  int x, y;
  int result = 1;

  cin >> N >> M;
  int friends[N][N];

  for(int i=0; i<N; i++)for(int j=0; j<N; j++)
    friends[i][j] = 0;

  for(int i=0; i<M; i++){
    cin >> x >> y;
    friends[x][y] = friends[x][y] = 1;
  }

for(int i=0; i<(1<<N); i++){
  bool ok = true;
  for(int j=0; j<N; j++)for(int k=0; k<N; k++){
    if(((i >> j) & 1) & ((i >> k) & 1) )
      if(friends[j][k] != friends[k][j]) ok = false;
  }

  if(ok) result = max(result, __builtin_popcount(i));
}

  cout << result << endl;

  return 0;
}

Submission Info

Judge Result