2013计算机B 统计节点个数

#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int out[1000];
vector<int> map[1000];
int main(int argc, char** argv) {
	int t;
	scanf("%d", &t);
	while (t--) {
		int n;
		scanf("%d", &n);
		for (int i = 0; i < n; ++i) {
			map[i].clear();
			out[i] = 0;
		}
		int r = n - 1;
		while (r--) {
			int x, y;
			scanf("%d%d", &x, &y);
			++out[x];
			++out[y];
			map[x].push_back(y);
			map[y].push_back(x);
		}
		int res = 0;
		for (int i = 0; i < n; ++i) {
			int d_n = out[i];
			bool flag = true;
			for (int j = 0; j < map[i].size(); ++j) {
				if (d_n < out[map[i][j]]) {
					flag = false;
					break;
				}
			}
			if (flag) ++res;
		}
		printf("%d\n", res);
	}
	return 0;
}