CAM5  prayatna PR
help the Prayatna pr team
Well, the annual technical symposium of Department of Computer Technology is around the corner. All that we need, to make it a grand success is Publicity among the peer groups ( ofCourse the sponsors too :P ). We decided to share the job between the student groups. As per the plan we decided to meet people in person and influence them to attend Prayatna. But to meet them we have to go to various student groups. To do so, we had to cut our classes. But being studious. students refused to cut more classes. Instead of meeting every one in person we decided to meet few people such that the person to whom we pass the news will spread it to all his friends. And those friends will pass it to other friends and so on. Your task is to find the number of people to be met by the organizers to spread the news.
Caution: Large I/O
Input
First line of input is 't'  Test cases. Follwed by N, the number of peers in the testcase ( 0 to N1 ). followed by the number of friend description 'e'. Following are 'e' descriptions of type "a b" denoting 'a' friends with 'b'. If 'a' is friends with 'b' then 'b' is friends with 'a'.
Output
Output contains t line, the number of people, the organizers have to meet in person for each test case.
Example
Input: 2 4 2 0 1 1 2 3 0 Output: 2 3
Explanation
case 1 : 0 is friends with 1; 1 is friends with 2; so if we pass the news to 0 & 3, news will pass it to the entire N peers.
case 2 : no one is friends with any one. So we have to meet every one in person.
Constraints
t = 10
2 <= N <= 100000
0 <= e <= N/2
hide comments
norhh:
20151231 18:40:30
Submitted a different file and got many WAs 

nigtskrishna:
20151126 19:39:55
On Eclipse and Ideone.com its working fine, I tried both DFS and BFS approaches but its saying time out, any once help me please.... 

Mayank Garg:
20151011 10:30:28
wa due to silly mistakes !! Well easy one :) 

Saket Sharma:
20150714 20:11:45
super easy :D 

jigar:
20150629 10:02:42
i am not getting 

Aditya Kumar:
20150418 15:09:51
use anything 

Andres Mauricio Rondon Patiño:
20150402 01:40:46
Did someone make it in python? I'm getting RTE :( but in C++ it runs perfect 

sai krishna:
20150307 14:11:22
simple connected components in a graph 

Vishesh Raimugia:
20150302 17:50:31
Too easy AC in first go was expecting TLE :P :/ 

Kriti Joshi:
20141211 05:54:37
First graph ques, AC in first attempt :) 
Added by:  karthikeyan 
Date:  20120111 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  own problem 