Submission #4409763

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include<iomanip>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
int n,m;
int ackn[13][13];

int flag[1000];
int res=0;

void calc()
{
  int cnt=0;
  for(int i=0;i<n;i++)
  {
    if(!flag[i])continue;
    cnt++;
    rep(j,n)
    {
      if(i==j)continue;
      if(flag[j])
      {
      if(ackn[i][j]);
      else return;
      }
    }

  }
  //cout<<cnt<<endl;
  res=max(res,cnt);
}

void dfs(int depth)
{
  if(depth==n)
  {
    calc();return;
  }
  flag[depth]=0;dfs(depth+1);
  flag[depth]=1;dfs(depth+1);
}
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin>>n>>m;
  rep(i,m)
  {
    int x,y;
    cin>>x>>y;
    ackn[x-1][y-1]=1;
    ackn[y-1][x-1]=1;
  }
  dfs(0);
  cout<<res<<endl;




  return 0;

}

Submission Info

Judge Result