Hide

# Problem FMaximum Clique

In an undirected graph, a clique is defined to be a subsets of vertices where all pairs are connected. Given such a graph, determine the size of a largest clique.

## Input

The first line contains the integer $V$ ($1 \le V \le 50$) and $E$ ($0 \le E \le \frac{V(V - 1)}{2}$), the number of vertices and edges in the graph, respectively.

The following $E$ lines each contains two different vertices numbered between $0$ and $N - 1$, the endpoints of an edge. No edge appears twice.

## Output

Output a single integer – the size of a largest clique in the graph.

## Scoring

Your solution will be tested on a set of test groups, each worth a number of points. To get the points for a test group you need to solve all test cases in the test group.

 Group Points Constraints $1$ $1$ $V \le 10$ $2$ $1$ $V \le 20$ $3$ $1$ $V \le 23$ $4$ $1$ $V \le 30$ $5$ $1$ No additional constraints
Sample Input 1 Sample Output 1
1 0

1

Sample Input 2 Sample Output 2
3 1
0 1

2

Sample Input 3 Sample Output 3
3 2
0 1
0 2

2

Sample Input 4 Sample Output 4
3 3
0 1
0 2
1 2

3

Hide