Submission #3232020

---

Source Code Expand

#include <iostream>
#include <vector>

using namespace std;

int N, M;
int a[100], b[100];

vector<int> Adj[100];

int check[100];

void visit(int M) {
	check[M] = 1;

	for (int i = 0; i < (int)Adj[M].size(); i++) {
		int H = Adj[M][i];
		if (check[H] == 0) { visit(H); }
	}
}

int main(void) {

	cin >> N>>M;

	for (int i = 1; i <= M; i++) {
		cin >> a[i] >> b[i];
	}

	for (int i = 1; i <= M; i++) {
		Adj[a[i]].push_back(b[i]);
		Adj[b[i]].push_back(a[i]);
	}

	int ans = 0;

	for (int i = 1; i <= M; i++) {
		for (int j = 1; j <= N; j++) { check[j] = 0; }
		for (int k = 1; k <= N; k++) { Adj[k].clear(); }
		for (int k = 1; k <= M; k++) {
			if (k == i) { continue; }
			Adj[a[k]].push_back(b[k]);
			Adj[b[k]].push_back(a[k]);
		}

		visit(1);
		bool sign = true;
		for (int k = 1; k <= N; k++) { if (check[k] == 0) { sign = false; } }
		if (!sign) {   ans++; }
	}

	cout << ans << endl;

	//system("pause");
	return 0;
}

Submission Info

Judge Result