Pagini recente » Cod sursa (job #1487837) | Istoria paginii runda/porc_again/clasament | Istoria paginii runda/simulare_oji_11_12_1 | Cod sursa (job #1703431) | Cod sursa (job #899979)
Cod sursa(job #899979)
#include <iostream>
#include<fstream>
#include<vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> v[100000];
int ap,m,n,j,d,i,z[100000],a,b;
void df(int nod,int &ap)
{
d=0;
for(size_t j=0;j<v[nod].size();j++)
if(!z[v[i][j]])
{
d++;
z[v[i][j]]=1;
df(v[i][j],ap);
}
if(!d)
ap++;
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
// for(i=1;i<=n;i++)
// {
// for(size_t j=0;j<v[i].size();j++)
// g<<v[i][j]<<' ';
// g<<endl;
// }
ap=1;
z[1]=1;
df(1,ap);
g<<ap;
return 0;
}