Submission #145521

---

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();
		boolean[][] kankei = new boolean[N][N];
		
		for(int i = 0; i < M; i++){
			kankei[sc.nextInt() - 1][sc.nextInt() - 1] = true;
		}
		
		int ret = 0;
		
		for(int i = 0; i < (1<<N); i++){
			
			int count = 0;
			boolean flag = true;
			
			for(int a = 0; a < N; a++){
				
				if((i>>a) % 2 == 0) continue;
				count++;
				
				for(int b = a + 1; b < N; b++){
					if((i>>b) % 2 == 0) continue;
					if(!kankei[a][b]) flag = false;
				}
				
				
				
			}
			
			if(flag) ret = Math.max(ret, count);
			
		}
		
		System.out.println(ret);
		
			
	}
	
}

Submission Info

Judge Result