Pagini recente » Cod sursa (job #201122) | Cod sursa (job #2003505) | Cod sursa (job #177415) | Cod sursa (job #1730921) | Cod sursa (job #1214366)
#include<fstream>
#include<vector>
using namespace std;
int nr,n,m;
vector<int>l[100003];
bool v[100003];
void dfs(int nod)
{
v[nod]=1;
for(int i=0;i<l[nod].size();i++)
if(v[l[nod][i]]==0)
{
dfs(l[nod][i]);
}
}
int main()
{
ifstream f("dfs.in");
ofstream g("dfs.out");
f>>n>>m;
int x,y;
for(int i=1;i<=m;i++)
{
f>>x>>y;
l[x].push_back(y);
l[y].push_back(x);
}
for(int i=1;i<=n;i++)
{
if(v[i]==0)
{
nr++;
dfs(i);
}
}
g<<nr;
return 0;
}