1905B - Begginer's Zelda - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
int main(){
    int t,n;
    cin >> t;
    for(int i =0;i<t;i++){
        cin>>n;
        vector<int> t(n,0);
        for(int j = 0; j<n-1;j++){
            int x,y;
            cin>>x >>y;
            t[x-1] = t[x-1]+1;
            t[y-1] = t[y-1]+1;
        }
        cout<<endl;
        int zelda = 0;
       for(int j =0 ;j<n;j++){
            if(t[j] ==1)zelda++;
       }
        if(zelda % 2 ==0 ){
            cout << zelda/2 <<endl;
        }else{
            cout <<(zelda+1)/2 <<endl;
        }
    }
    return 0;
}