Pagini recente » Cod sursa (job #2119077) | Cod sursa (job #281940) | Cod sursa (job #1991764) | Cod sursa (job #1815614) | Cod sursa (job #2674740)
#include <bits/stdc++.h>
#define ll long long int
#define double long double
#define pb push_back
#define endl '\n'
#define er erase
#define sz size
#define in insert
#define mp make_pair
#define f first
#define s second
#define mod 1000000007
//#define inf 1000000000
using namespace std;
ll cnt, b[1000], n, m;
vector<ll> a[1000];
void DFS(ll s)
{
b[s]=1;
for(ll i=0;i<a[s].sz();i++)
{
if(b[a[s][i]]==0) DFS(a[s][i]);
}
}
int main(){
cin>>n>>m;
for(ll j=1;j<=m;j++)
{
ll x, y;
cin>>x>>y;
a[x].pb(y);
a[y].pb(x);
}
for(ll i=1;i<=n;i++)
{
if(b[i]==0)
{
DFS(i);
cnt++;
}
}
cout<<cnt;
return 0;
}