题解 | #谁是你的潜在朋友#map的使用

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <queue>
#include <cmath>
using namespace std;

int stu[205];

int main() {
    int n, m; //n个人 m本书
    map<int, int> mymap; //<booknum, totallove>
    while (scanf("%d%d", &n, &m) != EOF) {
        for (int i = 0; i < n; i++) {
            int t;
            scanf("%d", &t);
            stu[i] = t; //第i个人，喜欢第t本书
            if (mymap.find(t) != mymap.end()) { //有人喜欢这本书
                mymap[t]++;
            } else {
                mymap[t] = 1;
            }
        }

        for (int i = 0; i < n; i++) {
            int t = stu[i];
            if (mymap[t] != 1) { //有人喜欢这本书              
                printf("%d\n", mymap[t] - 1);
            } else {
                printf("BeiJu\n");
            }
        }
    }
}