Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.
Submit All submissions Best solutions PDF Back to list

EICONP - Number of connected components

Given an undirected graph with n vertices and m edges. Vertices are numbered from 0 to n-1. Calculate the number of connected components in the given graph.

Input

The first line consists of two positive integers, the number n vertices  (0<n<105) and the number of edges m  (0<m<2x105).

Then there are m lines, each containing two integers u and v  representing an edge which connects u and v.(u,v<105).

Output

The number of connected components

Example

Input:
3 1 
1 2

Output:
2
Submit solution!
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.