Pagini recente » Cod sursa (job #3189273) | Cod sursa (job #1020013) | Cod sursa (job #2937607) | Cod sursa (job #93251) | Cod sursa (job #2202278)
#include <bits/stdc++.h>
#define N 100001
#define M 200001
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
int nr,vf[2*M],urm[2*M],lst[N];
bool viz[N];
void dfs(int x)
{
viz[x]=true;
int p=lst[x],y;
while(p)
{
y=vf[p];
if(!viz[y])
dfs(y);
p=urm[p];
}
}
void ad(int x,int y)
{
vf[++nr]=y;
urm[nr]=lst[x];
lst[x]=nr;
}
int main()
{
int n,m,i,x,y,s=0;
in>>n>>m;
for(i=0;i<m;i++)
{
in>>x>>y;
ad(x,y);
ad(y,x);
}
for(i=1;i<=n;i++)
if(!viz[i])
{
s++;
dfs(i);
}
out<<s;
return 0;
}