Pagini recente » Cod sursa (job #3327984) | Cod sursa (job #3335861) | Cod sursa (job #2714964) | Cod sursa (job #3340277) | Cod sursa (job #3334176)
#include <fstream>
#include <list>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,rasp;
list<int>vec[100010];
bool vis[100010];
void dfs(int x)
{
vis[x]=1;
for(auto nod : vec[x])
{
if(!vis[nod])
{
dfs(nod);
}
}
}
int main() {
f>>n>>m;
while(m--)
{
int x,y;
f>>x>>y;
vec[x].push_back(y);
vec[y].push_back(x);
}
for(int i=1;i<=n;i++)
{
if(!vis[i])
{
rasp++;
dfs(i);
}
}
g<<rasp;
return 0;
}