#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define pa pair<ll, ll>
#define fi first
#define se second
#define bit(mask, j) ((mask >> j) & 1)
const ll mod = 1e9 + 7;
const ll INF = 1e18;
//--------------------------------------------------------------------
const ll N = 500003;
ll deg[N];
void hbmt() {
ll n;
cin >> n;
FOR(i, 1, n - 1) {
ll u, v;
cin >> u >> v;
deg[u]++;
deg[v]++;
}
ll cnt = 0;
FOR(i, 1, n) {
if(deg[i] == 1) {
cnt++;
}
}
ll val = (cnt + 1) / 2;
cout << val;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
//int t;cin>>t;while(t--)
hbmt();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |