Pagini recente » Cod sursa (job #1182040) | Cod sursa (job #2360114) | Cod sursa (job #2741489) | Cod sursa (job #2835946) | Cod sursa (job #2012182)
#include <bits/stdc++.h>
using namespace std;
FILE *F=fopen("dfs.in", "r"), *G=fopen("dfs.out", "w");
int K, n, m, x, y;
vector<int> a[100005];
bitset<100005> w;
void dfs(int nod)
{
w[nod] = 1;
vector<int> :: iterator it;
for(it = a[nod].begin(); it != a[nod].end(); ++ it)
if(!w[*it]) dfs(*it);
}
int main()
{
fscanf(F, "%d %d", &n, &m);
for(int i = 1; i <= m; ++ i)
{
fscanf(F, "%d %d ", &x, &y);
a[x].push_back(y);
a[y].push_back(x);
}
for(int i = 1; i <= n; ++ i)
if(!w[i]) ++K, dfs(i);
fprintf(G, "%d ", K);
return 0;
}