题解 | 谁是你的潜在朋友

#include<iostream>
#include<map>
using namespace std;
int main(){
    int n,m;
    while(cin>>n>>m){
        map<int,int> m;
        int answer[n];
        for(int i=0;i<n;i++){
            int x;
            cin>>x;
            answer[i]=x;
            if(m.find(x)!=m.end()){
                m[x]++;
            }
            else{
                m.insert(pair<int,int>(x,0));
            }
        }
        for(int i=0;i<n;i++){
            if(m[answer[i]]==0){
                cout<<"BeiJu"<<endl;
            }
            else{
                cout<<m[answer[i]]<<endl;
            }
        }
    }
}