北京大学机试 谁是你的潜在朋友 Easy

基本思想：

自己想复杂了，把要给人选多门课给包含进去了；

 

关键点：

无；

 

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;

const int maxn = 210;

int main() {
	int m, n;
	int a;
	while (cin >> n >> m) {
		vector<int> cate[maxn];
		vector<int> hum[maxn];
		for (int i = 1; i <= n; i++) {
			cin >> a;
			hum[i].push_back(a);
			cate[a].push_back(i);
		}
		for (int i = 1; i <= n; i++) {
			int ht[maxn] = { 0 };
			int cnt = 0;
			for (int j = 0; j < hum[i].size(); j++) {
				for (int k = 0; k < cate[hum[i][j]].size(); k++) {
					if (ht[cate[hum[i][j]][k]] == 0) {
						cnt++;
						ht[cate[hum[i][j]][k]]++;
					}
				}
			}
			cnt--;
			if (cnt == 0)
				cout << "BeiJu" << endl;
			else
				cout << cnt << endl;
		}
	}
}