Responsive image

问题 2020 --热身 Root sum Numbers

2020: 热身 Root sum Numbers

时间限制: 1 Sec  内存限制: 128 MB
提交: 2  解决: 1
[提交][状态][讨论版][命题人:]

题目描述

n people take a particular exam.

In order to be fair, it is required that no two people who know each other should be in the same examination room.

Seeking truth needs to divide a few examination room ability to satisfy a condition less.

输入描述

In the first line, an integer n(1<n<100), represents the number of people who take the exam.
In the second line, have an integer m, indicates that there are m rows of data next
The format of each line of the following m lines is: two integers a and b, separated 
by spaces (1 <= a, b <= n) to indicate person a and person b know each other.

输出描述

An integer on a row indicates the minimum number of examination room.

样例输入

5
8
1 2
1 3
1 4
2 3
2 4
2 5
3 4
4 5

样例输出

4

来源

 

[提交][状态]
ACM算法攻关部