hdu 1213 How Many Tables
2016-05-14 11:14
323 查看
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 22581 Accepted Submission(s): 11238[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.
[align=left]Sample Input[/align]
2
5 3
1 2
2 3
4 5
5 1
2 5
[align=left]Sample Output[/align]
2
4
相关文章推荐
- ElasticSearch 攻略(一)
- 2016“百度之星”-测试赛
- getBackground().setAlpha所导致问题
- Beaver's Calculator 【归并排序+贪心】
- 手机开发实战17——CSD与GPRS的比较
- ArrayList源码分析
- 数据库中间件的收集
- 如何自学Android
- jQuery基于扩展实现的倒计时效果
- Flume快速入门(一):背景简介
- Mainfest.xml文件的初步解析
- 论strpos 的正确使用方式
- uva10816 Travel in Desert(MST + 最短路)
- 面向对象学习记录(一)
- android练习
- 论strpos 的正确使用方式
- 为什么富人越来越富,穷人越来越穷?
- hdu 1272 小希的迷宫
- JVM--第二章--深入理解对象的创建、内存布局、访问定位
- 深入理解trace.tracebegin