Pagini recente » Cod sursa (job #765881) | Cod sursa (job #263410) | Cod sursa (job #3314506) | Cod sursa (job #2815856) | Cod sursa (job #2050755)
#include <vector>
#include <fstream>
using namespace std;
vector <int> l[100000];
bool viz[100000];
void dfs(int nod) {
viz[nod]=1;
for(int i=0;i<l[nod].size();i++)
if(viz[l[nod][i]]==0) dfs(l[nod][i]);
}
int main(){
int m,n,nr=0;
ifstream fin("dfs.in");
fin>>m>>n;
for(int i=1;i<=m;i++) {
int x,y;
fin >> x >> y;
l[x].push_back(y);
l[y].push_back(x);
}
for(int i=1;i<=n;i++) {
if(viz[i]==0) {
dfs(i);
nr++;
}
}
ofstream fout("dfs.out");
fout << nr+1;
}