Codeforces Round 915 (Div. 2) 1905B - Begginer's Zelda Solution

 

Problem Link:   https://codeforces.com/problemset/problem/1905/B

Solution in C++:

1. /// Author : AH_Tonmoy
2. #include <bits/stdc++.h>
3. using namespace std;
4. int32_t main() {
5. ios_base::sync_with_stdio(0);
6. cin.tie(0);
7. int t;
8. cin >> t;
9. while (t--) {
10. int n ; cin >> n ;
11. int u , v ;
12. vector < int > cnt(n+2,0) ;
13. for ( int i = 0 ; i < n - 1 ; i++){
14. cin >> u >> v ;
15. cnt[u]++ ;
16. cnt[v]++ ;
17. }
18. int ans = 0 ;
19. for (int i = 1 ; i <= n ; i++){
20. if (cnt[i] == 1) ans++ ;
21. }
22. ans++ ;
23. cout << ans / 2 <<'\n';
24. }
25. return 0 ;
26. }