#include<bits/stdc++.h>
#include "communication.h"
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
// #define int ll
// #define N 
using namespace std;
const int N=2505;
int dfn[N],low[N],DFN,vis[N],vv[N];
poly G[N];
int tot;
void dfs(int k,int fa)
{
	dfn[k]=++DFN;
	low[k]=dfn[k];
	int son=0,bl=0;
	for (auto id:G[k])
	{
		if (vis[id]) continue;
		if (id==fa) continue;
		int u=vv[id]^k;
		// cout<<"edge "<<u<<" "<<k<<endl;
		if (dfn[u]==0)
		{
			son++;
			dfs(u,id);
			if (low[u]>=dfn[k]&&fa) bl=1; 
			low[k]=min(low[k],low[u]);
		} else
		{
			low[k]=min(low[k],dfn[u]);
		}
	}
	if (!fa&&son>=2) bl=1;
	tot+=bl;
	// cout<<k<<" "<<bl<<endl;
}
std::vector<int> find_num_critical(int n, std::vector< std::pair<int, int> > E)
{
	int m = (int)E.size();
	poly ans;
	for (int i=0;i<m;i++)
	{
		auto [u,v]=E[i];
		G[u].push_back(i);
		G[v].push_back(i);
		vv[i]=u^v;
	}
	for (int i=0;i<m;i++)
	{
		for (int j=1;j<=n;j++)
			dfn[j]=low[j]=0;
		vis[i]=1;
		tot=0;DFN=0;
		int tt=0;
		for (int j=1;j<=n;j++)
			if (!dfn[j])
			{
				tt++;
				dfs(j,-1);
				// cout<<endl;
			}
		// cout<<"??"<<tt<<endl;
		if (tt>2)
		{
			tt=n;
		} else
		if (tt==2)
		{
			tot=0;
			for (int j=1;j<=n;j++)
			{
				int u=0;
				for (auto id:G[j])
					if (id!=i) u++;
				if (u) tot++;
			}
		}
		ans.push_back(tot);
		vis[i]=0;
	}
	return ans;
}