Cod sursa(job #1887578)
Utilizator | Data | 21 februarie 2017 17:50:34 | |
---|---|---|---|
Problema | Zvon | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <iostream>
#include <fstream >
#include <vector >
using namespace std;
ifstream fin("zvon.in");
ofstream fout("zvon.out");
bool viz[100000];
vector <int>a[100000];
int niv=0;
int dfs (int nod)
{
viz[nod]=1;
niv++;
for (int i=1; i<=a[nod].size();++i)
if(!viz[a[nod][i]])
dfs(a[nod][i]);
}
int main()
{
int n,x,y, t;
fin>>t;
for (int i =1; i<=t; ++i)
{
fin>>n;
for(int j=1; j<n; ++j)
{
fin>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
dfs(1);
fout<<niv;
}
return 0;
}