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
imsaral:
20170621 22:31:21
My first Graph Question


ayushagg31:
20170613 13:41:17
just count the connecting components and you are good to go!!!


Siddharth:
20170409 08:42:57
AC code with C++ is WA with python. 

saikat777:
20170323 07:01:18
Nice warmup questions on graphs.


vunnamtej:
20170320 13:57:11
Black in one go 

abhishek181297:
20170312 12:54:00
solved using DFS can anyone tell me what is this UnionFind Method 

da_201501181:
20170303 12:16:23
AC twice!!


vengatesh15:
20170125 07:18:15
Simple one.. 

surajmall:
20161228 08:07:47
beginners in graph should try this :) 

ajmale:
20161116 19:59:07
easy one

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 