2606.cpp

#include <bits/stdc++.h>
#include <string>

using namespace std;

int n;
int m;
int temp;
bool infected[101];
bool connected[101][101];
int currentcounting = 0;
int temp1;
int maxi = 0;

int qsize = 0;







void bfs(int startc){
    queue<int> q;
    q.push(startc);
    infected[startc] = true;
    

    while(!q.empty()){
        int comp = q.front();
        q.pop();

        
        for(int i = 1; i < n + 1; i++){

            if(connected[comp][i] == true && infected[i] != true){
                q.push({i});
                infected[i] = true;   
                currentcounting++;
            }
            
            
        }

        
            
        
    }
    cout << currentcounting;

    
}



int main(){
    cin >> n;
    cin >> m;
    int i;
    for(i = 0; i < m; i++){
        cin >> temp;
        cin >> temp1;

        connected[temp][temp1] = true;
        connected[temp1][temp] = true;
        
        
    }
    bfs(1);
    
}