Pagini recente » Clasament surprize_surprize | Cod sursa (job #821819) | Cod sursa (job #811223) | Cod sursa (job #1039683) | Cod sursa (job #1049851)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,x,y,i,nr=0,nin;
bool este[100001],ok=1;
vector<int> v[100001];
void dfs(int k)
{
int j;
for(j=0;j<v[k].size();++j)
if(!este[v[k][j]])
{
este[v[k][j]]=1;
dfs(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(!este[i])
{
dfs(i);
este[i]=1;
nr++;
}
g<<nr;
f.close();g.close();
return 0;
}