1004 Counting Leaves

---

BFS

#include <cstdio>
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <cstring>
#include <vector>
#include <sstream>
#include <queue>
#include <algorithm>
#include <cmath>
#include <ctype.h>
using namespace std;
const int N = 105;
vector<int> G[N];
int h[N] = { 0 };//各结点所处的层号,从1开始
int leaf[N] = { 0 };//存放每层的叶子结点的个数
int max_h = 0;
void BFS() {
	queue<int> q;
	q.push(1);
	while (!q.empty()) {
		int id = q.front();
		q.pop();
		max_h = max(max_h, h[id]);
		if (G[id].size() == 0)
			leaf[h[id]]++;
		for (int i = 0; i < G[id].size(); i++) {
			h[G[id][i]] = h[id] + 1;
			q.push(G[id][i]);
		}
	}
}
int main() {
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 0; i < m; i++) {
		int parent, k, child;
		scanf("%d%d", &parent, &k);
		for (int j = 0; j < k; j++) {
			scanf("%d", &child);
			G[parent].push_back(child);
		}
	}
	h[1] = 1;
	BFS();
	for (int i = 1; i <= max_h; i++) {
		printf("%d", leaf[i]);
		if (i != max_h)	printf(" ");
	}
	return 0;
}

DFS

---

#include <cstdio>
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <cstring>
#include <vector>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <ctype.h>
using namespace std;
const int maxn = 110;
vector<int> child[maxn];
int leaf[maxn] = { 0 };
int n, m, max_h = 0;
void DFS(int index, int h) {
	max_h = max(h, max_h);
	if (child[index].size() == 0) {
		leaf[h]++;
		return;
	}
	for (int i = 0; i < child[index].size(); i++)
		DFS(child[index][i], h + 1);
}
int main() {
	scanf("%d%d", &n, &m);
	int k, tmp, parent;
	for (int i = 0; i < m; i++) {
		scanf("%d%d", &parent, &k);
		for (int j = 0; j < k; j++) {
			scanf("%d", &tmp);
			child[parent].push_back(tmp);
		}
	}
	DFS(1, 1);
	printf("%d", leaf[1]);
	for (int i = 2; i <= max_h; i++) {
			printf(" %d", leaf[i]);
	}
	return 0;
}