Submission #2515097

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef  long long int ll;

int edge, vert;
bool used[100];
vector<int> G[100];

void dfs(int v) {
    edge += G[v].size();
    for (int i = 0; i < G[v].size(); i++) {
        if (!used[G[v][i]]) {
            vert++;
            used[G[v][i]] = true;
            dfs(G[v][i]);
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int n, m, cnt = 0;
    
    cin >> n >> m;
    
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--;b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    
    for (int i = 0; i < n; i++) {
        edge = 0;
        vert = 1;
        if (!used[i]) {
            used[i] = true;
            dfs(i);
            if(vert - 1 == edge/2)
                cnt++;
        }
    }
    cout << cnt << endl;
    
    
    return 0;
}

Submission Info

Judge Result