Răspuns:
#include <fstream>
using namespace std;
ifstream fin("componenteconexe1.in");
ofstream fout("componenteconexe1.out");
bool a[101][101], b[101];
int n;
int dfs(int nod)
{
b[nod] = 1;
int nod_p = 1;
for (int i = 1; i <= n; i++)
{
if (a[nod][i] && b[i] == 0)
{
nod_p += dfs(i);
}
}
return nod_p;
}
int main()
{
int x, y, m = 0;
fin >> n;
while (fin >> x >> y)
{
if (a[x][y] == 0)
{
m++;
}
a[x][y] = a[y][x] = 1;
}
for (int i = 1; i <= n; i++)
{
if (b[i] == 0)
{
m -= dfs(i) - 1;
}
}
fout << m;
}
