Pagini recente » Cod sursa (job #2584760) | Cod sursa (job #3141581) | Cod sursa (job #1875717) | Cod sursa (job #1785570) | Cod sursa (job #1120074)
#include <iostream>
#include <fstream>
using namespace std;
int n,m,s,i,j,x,y,a[10000][10000];
bool v[100000];
ifstream f("dfs.in");
ofstream g("dfs.out");
void parcurgerea(int i)
{
v[i]=true;
for (j=1;j<=m;j++)
if ((a[i][j]==1)&&(v[j]==false))
{
parcurgerea (j);
}
}
int main()
{
f>>n>>m;
for (i=1;i<=m;i++)
{
f>>x>>y;
a[x][y]=1;
}
for (i=1;i<=n;i++)
{
if (v[i]==false)
s++;
parcurgerea (i);
}
g<<s;
return 0;
}