Submission #111641

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>

using namespace std;
int maps[14][14];

bool check(int i)
{
  int count=0;
  for(;i>0;i=i>>1)
    {
      //      cout<<"check-i"<<i<<endl;
      if(i%2==1)
	{
	  int count2=count+1;
	  for(int j=i>>1;j>0;j=j>>1)
	    {
	      //	      cout<<"check-j"<<j<<endl;
	      if(j%2==1)
		{
		  if(maps[count][count2]==0)
		    return false;
		}
	      count2++;
	    }
	}
      count++;
    }
  return true;
}

int main()
{
  int n,m;
  for(;cin>>n>>m;)
    {
      memset(maps,0,sizeof(maps));
      for(int i=0;i<m;i++)
	{
	  int x,y;
	  cin>>x>>y;
	  maps[x-1][y-1]=1;
	  maps[y-1][x-1]=1;
	}
      int ans=0;
      for(int i=0;i<=(1<<n);i++)
	{
	  ///	  cout<<i<<"  :"<<(1<<n)<<endl;
	  if(check(i))
	    {
	      int bitcount=0;
	      for(int x=i;x>0;x=x>>1)
		{
		  if(x%2==1)
		    bitcount++;
		}
	      ans=max(ans,bitcount);  
	    }
	}
      cout<<ans<<endl;
    }
}

Submission Info

Judge Result