Pagini recente » Cod sursa (job #2277610) | Cod sursa (job #740469) | Cod sursa (job #1396281) | Clasament 2017simoji | Cod sursa (job #1825892)
#include <iostream>
#include <fstream>
#include <vector>
#define N 15010
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int i,j,nr=0,n,m,k,viz[N],el,a[N][N];
void dfs(int x)
{
viz[x]=1;
for(int k1=1;k1<=n;k1++)
{
if(a[x][k1]==1 && viz[k1]==0)
{
dfs(k1);
}
}
}
int main()
{
int x1,y1;
f>>n>>k;
for(i=1;i<=k;i++)
{
f>>x1>>y1;
a[x1][y1]=1;
}
for(i=1;i<=n;i++)
{
if(viz[i]==0)
{
nr++;
dfs(i);
}
}
g<<nr;
}