Pagini recente » Cod sursa (job #1649054) | Istoria paginii runda/abcdefghijklmnop | Cod sursa (job #29736) | Cod sursa (job #2929065) | Cod sursa (job #680833)
Cod sursa(job #680833)
#include<cstdio>
#include<vector>
#include <iterator>
int viz[200005],m,n,i,j,k,l,a,b;
using namespace std;
vector<int>v[200005];
int main()
{
int rez=0;
freopen("dfs.in","r",stdin);
freopen("dfs.out","w",stdout);
scanf("%d %d/n",&n,&m);
for (i=1;i<=m;i++)
{
scanf("%d %d/n",&a,&b);
v[a].push_back(b);
v[b].push_back(a);
}
for (i=1;i<=n;i++)
{
int ok=0;
for(vector<int>::iterator it=v[i].begin();it!=v[i].end();it++)
if(!viz[(*it)]) viz[(*it)]=1; else
ok=1;
if ((viz[i]==0)&&(!ok)) rez++;
viz[i]=1;
}
printf("%d",rez);
return 0;
}