Untitled
unknown
plain_text
a year ago
688 B
9
Indexable
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl "\n"
const double PI = 3.14159265358979;
const ll INF = 1e9 + 7;
const ll MOD = 1e9 + 7;
const ll nax = 2505;
const int LOG = 25;
void solve() {
int n;
cin >> n;
vector<int> deg(n + 1, 0);
for (int i = 1; i < n; i++) {
int x, y;
cin >> x >> y;
deg[x]++;
deg[y]++;
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, deg[i]);
}
cout << ans + 1;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
// int t; cin >> t; while(t--)
solve();
return 0;
}Editor is loading...
Leave a Comment