1.25题目翻译

原题链接：https://acs.jxnu.edu.cn/problem/HDU1213

Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.

One important rule for this problem is that if I tell you A knows B, and B knows C, that means A, B, C know each other, so they can stay in one table.

For example: If I tell you A knows B, B knows C, and D knows E, so A, B, C can stay in one table, and D, E have to stay in the other one. So Ignatius needs 2 tables at least.

输入：

The input starts with an integer T(1<=T<=25) which indicate the number of test cases. Then T test cases follow. Each test case starts with two integers N and M(1<=N,M<=1000). N indicates the number of friends, the friends are marked from 1 to N. Then M lines follow. Each line consists of two integers A and B(A!=B), that means friend A and friend B know each other. There will be a blank line between two cases.

输出：

For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.

今天是Ignatius的生日。他邀请了很多朋友。现在是晚餐时间。Ignatius想知道他至少需要多少张桌子。你必须注意到不是所有的朋友都认识， 而且所有的朋友都不想和陌生人呆在一起。解决这个问题的一个重要规则是，如果我告诉你A知道B，B知道C，这意味着A，B，C彼此知道，所以他们可以呆在一个里面 表例如：如果我告诉你A知道B，B知道C，D知道E，所以A，B，C可以留在一个表中，D，E必须留在另一个表。所以他至少需要两张表。

输入：

输入以一个整数T(1<=T<=25)开始，它表示测试用例的数量。然后是T测试用例。每个测试用例以两个整数N和M开始(1<=N，M<=1000)。N表示数字o f是朋友，朋友被标记从1到n。然后M行跟随。每一行由两个整数A和B组成(A！=B)组成，这意味着朋友A和朋友B彼此认识。接下来会有一条空白行 在两种情况下。

输出：

对于每个测试用例，只需输出依火爵至少需要多少个表。不要打印任何空格。