Pagini recente » Cod sursa (job #222063) | Cod sursa (job #1781274) | Cod sursa (job #970051) | Cod sursa (job #632664) | Cod sursa (job #2777401)
#include <fstream>
#include <vector>
#include <bitset>
std::ifstream in("zvon.in");
std::ofstream out("zvon.out");
const int N = 1e5;
std::vector<int> g[N + 1];
int extra = 0;
int dfs(int node) {
int max = 0;
int ret = 0;
for (auto x : g[node]) {
int t = dfs(x);
if (t == max) {
++ret;
}
else if (t > max) {
ret = max = t;
}
}
return ret + 1;
}
void test() {
int n;
in >> n;
for (int i = 1; i < n; ++i) {
int a, b;
in >> a >> b;
g[a].push_back(b);
}
out << dfs(1) - 1 << '\n';
for (int i = 1; i <= n; ++i) {
g[i].clear();
}
}
int main() {
int t;
in >> t;
for (int i = 0; i < t; ++i) {
test();
}
}