Submission #810361

---

Source Code Expand

import java.util.*;
public class Main{
	public static void main(String[] args){
		Scanner stdIn = new Scanner(System.in);
		int N = stdIn.nextInt();
		int M = stdIn.nextInt();
		
		int[] x = new int[M];
		int[] y = new int[M];
		for(int i = 0; i <= M - 1; i++){
			x[i] = stdIn.nextInt();
			y[i] = stdIn.nextInt();
		}
		
		int ans = 1;
		changeGroup: for(int i = 1; i <= Math.pow(2, N) - 1; i++){
			String temp = Integer.toBinaryString(i);
			int tempL = temp.length();
			String groupS = "";
			for(int j = 1; j <= tempL; j++){
				groupS += (temp.charAt(tempL - j) == '1' ? "," + j : "");
			}
			groupS = groupS.replaceFirst(",", "");
			String[] groupAr = groupS.split(",");
			
			
			int groupL = groupAr.length;
			if(groupL <= 1){
				continue changeGroup;
			}
			for(int a = 0; a <= groupL - 1; a++){
				for(int b = a + 1; b <= groupL - 1; b++){
					boolean flag = false;
					for(int j = 0; j <= M - 1; j++){
						if(Integer.parseInt(groupAr[a]) == x[j] && Integer.parseInt(groupAr[b]) == y[j]){
							flag = true; break;
						}
					}
					if(!flag){
						continue changeGroup;
					}
				}
			}
			ans = (ans > groupL ? ans : groupL);
		}
		
		System.out.println(ans);
	}
}

Submission Info

Judge Result