Submission #3231705

---

Source Code Expand

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

int graph[60][60] = {};
int memo[60] = {};
int n, m;

void dfs(int i){
  if(memo[i] != 0) return;
  memo[i] = 1;
  for(int j = 0;j < n;j++){
    if(graph[i][j] == 1){
      dfs(j);
    }
  }
  return;
}

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

  int a,b;
  for(int i = 0;i < m;i++){
    cin >> a >> b;
    a--; b--;
    graph[a][b] = 1;
    graph[b][a] = 1;
  }

  int ans = 0;
  for(int i = 0;i < n;i++){
    for(int j = 0;j < n;j++){
      if(graph[i][j] == 1){
        graph[i][j] = 0;
        graph[j][i] = 0;
        for(int x = 0;x < n;x++) memo[x] = 0;
        dfs(0);
        for(int x = 0;x < n;x++){
          if(memo[x] == 0){
            ans++;
            break;
          }
        }
        graph[i][j] = 1;
        graph[j][i] = 1;
      }
    }
  }

  if(ans != 0){
    cout << ans/2 << endl;
  }else{
    cout << ans << endl;
  }

  return 0;
}

Submission Info

Judge Result