Pagini recente » Cod sursa (job #1770003) | Istoria paginii runda/allyoucancode2008 | Cod sursa (job #1473840) | Istoria paginii runda/summer_camp_9/clasament | Cod sursa (job #1473363)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int x,y,n,m,con,i;
bool viz[100001];
vector<int> v[100001];
void dfs(int nod)
{
viz[nod]=1;
for(int j=0;j<v[nod].size();j++)
if(viz[v[nod][j]]==0)
dfs(v[nod][j]);
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(i=1;i<=n;i++)
if(viz[i]==0)
{
con++;
dfs(i);
}
g<<con;
return 0;
}