Pagini recente » Cod sursa (job #1666888) | Cod sursa (job #1585575) | Cod sursa (job #1944288) | Cod sursa (job #2263074) | Cod sursa (job #2376040)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> v[1000];
int viz[1000],n,k,a,b,nr;
void dfs(int x)
{
viz[x]=1;
for(int i=0;i<v[x].size();i++)
if(viz[v[x][i]]==0)
dfs(v[x][i]);
}
int main()
{
f>>n>>k;
for(int j=1;j<=k;j++)
{
f>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(int i=1;i<=n;i++)
if(viz[i]==0)
{nr++;
dfs(i);}
g<<nr;
return 0;
}