Pagini recente » Cod sursa (job #2159764) | Cod sursa (job #3240618) | pregatireoji-lensumin120pct | Cod sursa (job #553764) | Cod sursa (job #2501979)
#include <fstream>
using namespace std;
const int N=100001;
const int M=2*N;
int n,m,lst[N],vf[2*M],urm[2*M],nr,st,dr,cnt;
bool viz[N];
ifstream in("dfs.in");
ofstream out("dfs.out");
void adauga(int x, int y)
{
vf[++nr]=y;
urm[nr]=lst[x];
lst[x]=nr;
}
void dfs(int x)
{
viz[x]=true;
for(int p=lst[x];p!=0;p=urm[p])
{
int y=vf[p];
if(!viz[y])dfs(y);
}
}
int main()
{
in>>n>>m;
for(int i=1;i<=m;i++)
{
in>>st>>dr;
adauga(st,dr);
adauga(dr,st);
}
for(int i=1;i<=n;i++)
{
if(!viz[i])
{
cnt++;
dfs(i);
}
}
out<<cnt;
return 0;
}