Submission #3720638

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

vector<int>  e[101];
bool checked[101];

bool dfs(int x,int y){
	if(checked[x])return false;

	checked[x]=true;


	for (int i = 0; i < e[x].size() ; ++i){
		if(e[x][i]==y)continue;
		if(!dfs(e[x][i],x))return false;	
	}

	return true;

}


int main(){
	int n,m;
	cin >> n >> m;

	int u,v;
	for (int i = 0; i < m; ++i){
		cin >> u >> v;
		e[u].push_back(v);
		e[v].push_back(u);
	}

	int ans=0;
	for (int i = 0; i < n; ++i){
		if(dfs(i+1,-1))
			ans++;
	}

	cout<<ans<<endl;


}

Submission Info

Judge Result