Submission #182060

---

Source Code Expand

import java.util.Scanner;
	
public class Main {
	
	public static void main(String[] args) {

		Scanner sc=new Scanner(System.in);
		
		int N=sc.nextInt();
		int M=sc.nextInt();
		int ninzu=0;
		int max=0;
		boolean[][]c=new boolean[N][N]; 
		boolean f=true;
		
		
		for(int i=0;i<M;i++){
		    int x=sc.nextInt();
		    int y=sc.nextInt();
		    c[x-1][y-1]=true;
		    c[y-1][x-1]=true;
		}
		
		for(int i=1;i<(1<<N);i++){
			f=true;
			ninzu=0;
			for(int ii=0;ii<N;ii++){
				if((i>>ii)%2==1){ninzu++;
			bi:	for(int b=ii+1;b<N;b++){if((i>>b)%2==1){
					if(c[ii][b]==false){f=false;break bi;}
				}
				}
			}
			if(f==true){max=Math.max(max, ninzu);}}
			
		}
		System.out.println(max);
		
		}
}

Submission Info

Judge Result