Pagini recente » Cod sursa (job #2347253) | Cod sursa (job #2691872) | Cod sursa (job #2350469) | Monitorul de evaluare | Cod sursa (job #2195449)
#include <fstream>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
int T[2][400005],start[100005],d[100005],cnt;
void umple(int poz)
{
d[poz]=1;
int i;
for(i=start[poz]; i>0; i=T[1][i])
if(d[T[0][i]]==0)
umple(T[0][i]);
}
int main()
{
int k=0,n,m,l,i,j;
in>>n>>m;
for(l=1; l<=m; l++)
{
in>>i>>j;
T[0][++k]=j;
T[1][k]=start[i];
start[i]=k;
T[0][++k]=i;
T[1][k]=start[j];
start[j]=k;
}
for(i=1; i<=n; i++)
{
if(d[i]==0)
{
umple(i);
cnt++;
}
}
out<<cnt;
return 0;
}