Pagini recente » Clasament wellcodesimulareoni1 | Cod sursa (job #1968632) | Cod sursa (job #1023265) | Clasament 3dtu | Cod sursa (job #1837384)
#include <iostream>
#include <fstream>
#include <vector>
#define nrmax 101
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n , m , x;
vector < int > G[nrmax];
vector < int > ::iterator j ;
bool used[nrmax];
void dfs( int x )
{
//g << x << " " ;
used[x] = 1;
for ( int j = 0 ; j < G[x].size() ; j++ )
{
if ( !used[ G[x][j] ] )
{
dfs( G[x][j] );
}
}
}
int main()
{
f >> n >> m ;
for ( ; m-- ; )
{
int a,b;
f >> a >> b;
G[a].push_back(b);
G[b].push_back(a);
}
int a,b,cnt=0;
/* f >> n;
while ( f >> a >> b ) G[a].push_back(b) , G[b].push_back(a) ; */
for ( int i = 1; i <= n ; i++ )
{
if ( !used[i] )
{
dfs(i);
cnt++;
}
}
g << cnt ;
return 0;
}