# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
344650 | bachaquer | Shymbulak (IZhO14_shymbulak) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
ll n, x, m, y;
vector<vector<ll>> v;
ll was[1000];
ll rast = 0, mx = -1, sum = 0;
void dfs (ll n) {
was[n] = 1;
rast++;
for (int i = 0; i < v[n].size(); i++) {
if (!was[i]) dfs(v[n][i]);
}
if (rast > mx) {
mx = rast;
sum = 1;
}
else if (rast == mx) {
sum++;
}
rast--;
was[n] = 0;
}
int main() {
cin >> n;
vector<ll> v[n];
for (int i = 0; i <= n; i++) {
v.pb({});
}
for (int i = 0; i < n; i++) {
cin >> x >> y;
v[x].pb(y);
v[y].pb(x);
}
for (int j = 1; j <= n; j++) {
dfs(j);
}
cout << sum;
return 0;
}