Pagini recente » Cod sursa (job #1480864) | Cod sursa (job #2368945) | Cod sursa (job #235094) | Cod sursa (job #154434) | Cod sursa (job #996052)
Cod sursa(job #996052)
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream f("zvon.in");
ofstream g("zvon.out");
vector <int> G[100002];
bool Use[100002];
int N,T,Result;
void Read()
{
f>>N;
int i;
for(i=1;i<=N-1;i++)
{
int x,y;
f>>x>>y;
G[x].push_back(y);
}
}
void DFS(int nod)
{
unsigned int i;
Use[nod]=1;
int number=0;
for(i=0;i<G[nod].size();i++)
{
int Vecin=G[nod][i];
if(!Use[Vecin])
{
DFS(Vecin);
Result+=number;
number=1;
}
}
}
int main()
{
f>>T;
while(T!=0)
{
Read();
Result=0;
memset(Use,0,sizeof(Use));
DFS(1);
if(Result!=0)
Result++;
g<<Result<<"\n";
T--;
}
return 0;
}