Pagini recente » Borderou de evaluare (job #103485) | Cod sursa (job #1219633) | Cod sursa (job #1944566) | Cod sursa (job #253812) | Cod sursa (job #854502)
Cod sursa(job #854502)
#include<stdio.h>
#include<vector>
using namespace std;
int mark[10001];
vector <int> G[10001];
void dfs(int a)
{
mark[a]=1;
for(int i=0; i < G[a].size();i++)
if(mark[G[a][i]]==0)
dfs(G[a][i]);
}
int main()
{
FILE*f,*g;
f=fopen("dfs.in","r");
g=fopen("dfs.out","w");
int N,M,k=0;
fscanf(f,"%d%d",&N,&M);
int x,y;
for(int i=1;i<=M;i++)
{
fscanf(f,"%d%d",&x,&y);
G[x].push_back(y);
G[y].push_back(x);
}
for(int i=1;i<=N;i++)
{
if(mark[i]==0)
{
dfs(i);
k++;
}
}
fprintf(g,"%d",k);
return 0;
}