#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <sstream>
#include <climits>
#include <cstring>
using namespace std;
//1156
int reader[201],book[201];
int main(){
int n,m;
//freopen("input.txt","r",stdin);
while(cin>>n>>m){
memset(reader,0,sizeof(reader));
memset(book,0,sizeof(book));
for(int i=1;i<=n;i++){
int p;
cin>>p;
reader[i]=p;
book[p]++;
}
for(int i=1;i<=n;i++){
if(book[reader[i]]>1)
cout<<book[reader[i]]-1<<endl;
else
cout<<"BeiJu"<<endl;
}
}
return 0;
}
/**************************************************************
Problem: 1156
User: cust123
Language: C++
Result: Accepted
Time:20 ms
Memory:1520 kb
****************************************************************/
题目1156:谁是你的潜在朋友
最新推荐文章于 2024-02-18 20:08:22 发布