Submission #2861190

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<pair<ll, ll> > vp;
typedef vector<string> vs;
typedef vector<char> vc;
typedef list<ll> lst;
typedef pair<ll, ll> P;
const long long INF = 1e9;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
template <class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
 
ll n, m, k, ans = 0, sum = 0, cnt = 0;
string s;
//char c;
 
#define Endl endl
 
/*--------------------template--------------------*/

int main() {
    ll N, M;
    cin>>N>>M;
    vi v1(M),v2(M);
    REP(i,M)cin>>v1[i]>>v2[i];   
    REP(i,M){
        vector<vi> d(N,vi(N, INF));
        REP(j,M){
            if(i==j)continue;
            ll va=v1[j]-1;
            ll vb=v2[j]-1;
            d[va][vb]=1;
            d[vb][va]=1;
        }
        REP(l,N)REP(j,N)REP(k,N){
            d[j][k]=min(d[j][k],d[j][l]+d[l][k]);
        }
        bool ok=true;
        FOR(j,1,N){
            if(d[0][j]==INF){
                ok=false;
                break;
            }
        }
        if(!ok)ans++;
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result