Submission #8847901

---

Source Code Expand

#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
bool visited[55], v[55][55], used[55][55];
int n, m;
void dfs(int e)
{
	if (visited[e]) return;
	visited[e] = 1;
	for(int i = 1; i <= 50; i++)
		if (v[e][i]) dfs(i);
}
int main(void)
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int cnt = 0, ans = 0;
	cin>>n>>m;
	for(int i = 1; i <= m; i++)
	{
		int a, b;
		cin>>a>>b;
		v[a][b] = v[b][a] = 1;
	}
	for(int i = 1; i <= n; i++)
		if (!visited[i]) dfs(i), cnt++;
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= 50; j++)
		{
			if (!v[i][j] || used[i][j]) continue;
			used[i][j] = used[j][i] = 1;
			int Cnt = 0;
			for(int k = 1; k <= 50; k++) visited[k] = 0;
			v[i][j] = v[j][i] = 0;
			for(int k = 1; k <= n; k++)
				if (!visited[k]) dfs(k), Cnt++;
			if (Cnt > cnt) ans++;
			v[i][j] = v[j][i] = 1;
		}
	if (ans)
		cout<<ans;
	cout<<'\n';
	return 0;
}

Submission Info

Judge Result