Pagini recente » Cod sursa (job #2814797) | Cod sursa (job #2780209) | Monitorul de evaluare | Cod sursa (job #1934813) | Cod sursa (job #2148854)
#include <bits/stdc++.h>
using namespace std;
const int MAX = 100005;
vector < int > myVector[MAX];
int Grad[MAX];
int T,N;
inline void scanData()
{
scanf("%d", &N);
for ( int i = 1; i <= N ; ++i)
{
myVector[i].clear();
Grad[i] = 0;
}
for ( int i = 1; i <= N-1 ; ++i)
{
int x,y;
scanf("%d%d", &x,&y);
myVector[x].push_back(y);
Grad[x]++;
}
}
int main()
{
freopen("zvon.in", "r" ,stdin);
freopen("zvon.out" , "w" ,stdout);
scanf("%d", &T);
for ( int i = 1; i <= T ; ++i)
{
scanData();
int Answer = 0;
for ( int i = 1; i <= N ; ++i)
if(Grad[i] == 0)
Answer++;
if( N == 1)
printf("0\n");
else
printf("%d\n" , Answer);
}
}