Pagini recente » Borderou de evaluare (job #1032420) | Cod sursa (job #2867287) | Cod sursa (job #3226623) | Rezultatele filtrării | Cod sursa (job #1804072)
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,i,j,x,y,a[10001][10001];
bool sel[100001];
void load()
{
f>>n>>m;
for (i=1; i<=m; i++)f>>x>>y,a[x][y]=1,a[y][x]=1;
}
void DF(int x)
{int i;
sel[x]=true;
for (i=1;i<=n;i++)if (a[x][i]==1 && !sel[i]) DF(i);
}
int main()
{
load();
int nr=0;
for (i=1;i<=n;i++)if (!sel[i])nr++,DF(i);
g<<nr;
return 0;
}