Submission #2547677

---

Source Code Expand

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

typedef long long ll;
typedef pair<ll, ll> P;

#define pb push_back
#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, n) for(int i = a; i < (n); i++)
#define mod (ll)(1e9+7)
#define int ll

__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}

ll n, m, a, b, result = 0, ch[50];
bool hen[50][50];
void dfs(int p) {
  if(ch[p] != 1) return;
  int i;
  for(i = 1; !hen[p][i]; i++);
  result++;
  hen[p][i] = hen[i][p] = false;
  ch[p]--; ch[i]--;
  dfs(i);
}
signed main() {
  cin >> n >> m;
  rep(i, m) {
    cin >> a >> b;
    hen[a][b] = hen[b][a] = true;
    ch[a]++; ch[b]++;
  }
  FOR(i, 1, n + 1) dfs(i);
  cout << result << endl;
}

Submission Info

Judge Result