Problem:
Score : 300 points

Problem Statement

There are N cities numbered 1 through N, and M bidirectional roads numbered 1 through M.
Road i connects City A_i and City B_i.

Snuke can perform the following operation zero or more times:

Choose two distinct cities that are not directly connected by a road, and build a new road between the two cities.

After he finishes the operations, it must be possible to travel from any city to any other cities by following roads (possibly multiple times).

What is the minimum number of roads he must build to achieve the goal?

Constraints

2 \leq N \leq 100,000

1 \leq M \leq 100,000

1 \leq A_i < B_i \leq N

No two roads connect the same pair of cities.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N M
A_1 B_1
:
A_M B_M

Output

Print the answer.

Sample Input 1

3 1
1 2

Sample Output 1

1

Initially, there are three cities, and there is a road between City 1 and City 2.

Snuke can achieve the goal by building one new road, for example, between City 1 and City 3.
After that,

We can travel between 1 and 2 directly.

We can travel between 1 and 3 directly.

We can travel between 2 and 3 by following both roads (2 - 1 - 3).

Solution in C (GCC 9.2.1) (judge verdict: Runtime Error)

#include<stdio.h>

int main(){
    int n,m;
    scanf("%d%d",&n,&m);
    int a[m][2],b[n][n];
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            b[i][j]=1;
        }
    }
    for(int i=0;i<m;i++){
        scanf("%d%d",&a[i][0],&a[i][1]);
        int judge=1;
        for(int j=a[i][0]+1;j<n;j++){
            judge*=b[a[i][0]][j];
            if(judge!=0){
                b[a[i][0]-1][a[i][1]-1]=0;
            }else{
                b[a[i][0]][a[i][1]-1]=0;
            }
        }
    }

    int road=0;
    for(int i=0;i<n;i++){
        int sum=1;
        for(int j=i+1;j<n;j++){
            sum*=b[i][j];
        }
        if(sum==0){
            road++;
        }
    }
    printf("%d",road);
    return 0;
}