Pagini recente » Istoria paginii runda/lol_contest_02 | Cod sursa (job #2853745) | Istoria paginii runda/antr2 | Istoria paginii runda/ioi_training/clasament | Cod sursa (job #900189)
Cod sursa(job #900189)
#include <iostream>
#include<fstream>
#include<vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> v[10000];
int ap,m,n,j,d,i,z[10000],a,b,x,con;
void df(int nod,int &ap)
{
for(size_t j=0;j<v[nod].size();j++)
if(!z[v[nod][j]])
{
z[v[nod][j]]=1;
df(v[nod][j],ap);
}
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
// for(i=1;i<=n;i++){for(size_t j=0;j<v[i].size();j++)g<<v[i][j]<<' ';g<<endl;}
con=0;
for(i=1;i<=n;i++)
{
if(!z[i])
{
con++;
df(i,ap);
}
}
g<<con;
return 0;
}