C :

#include<stdio.h>
int main()
{
  int n,m;
  int index=0;
  int *vec,*sat;
  
  while(EOF!=scanf("%d %d",&n,&m)){
    index=0;
  	vec = (int*)malloc(n*sizeof(int));
  	sat = (int*)malloc((m+1)*sizeof(int));
  	memset(sat,0,sizeof(int)*(m+1));
  	while(index<n){
  		scanf("%d\n",(vec+index));
    	index++;
  	}
  	for(index=0;index<n;index++){
  		sat[vec[index]]++;
  	}
  	for(index=0;index<n;index++){
    	if(sat[vec[index]]>1){
    		printf("%d\n",sat[vec[index]]-1);
    	}
    	else
    	{
      	printf("BeiJu\n");
    	}
 	 }
 	 free(vec);
  	 free(sat);
  }
}

C++ :

#include <stdio.h>

int main(){
	int n, m;
	while(scanf("%d%d", &n, &m) != EOF){
		int countBook[220] = {0};
		int nums[220];
		for(int i=0; i<n; i++){
			scanf("%d", &nums[i]);
			countBook[nums[i]]++;
		}
		for(int i=0; i<n; i++){
			if(countBook[nums[i]]-1){
				printf("%d\n", countBook[nums[i]]-1);
			}else{
				puts("BeiJu");
			}
		}
	}

	return 0;
}

Pascal :

var
 n,m,i,j:longint;
 a:array[1..20000]of longint;
 b:array[1..20000]of longint;
begin 
while not(eof) do begin 
  readln(n,m);fillchar(b,sizeof(b),-1);
  for i:=1 to n do begin 
     readln(a[i]);
	 inc(b[a[i]]);
   end;
   for i:=1 to n do
       if b[a[i]]=0 then writeln('BeiJu') else writeln(b[a[i]]);
end;
end.

Java :

import java.util.*;

public class Main{
  final static Scanner jin=new Scanner(System.in);
  public static void main(String args[]){
    while(jin.hasNextInt()){
      int N=jin.nextInt(),M=jin.nextInt();
      int P[]=new int[M+1];
      Arrays.fill(P,-1);
      int likes[]=new int[N];
      for(int i=0;i<N;i++){
        likes[i]=jin.nextInt();
        P[likes[i]]++;
      }
      for(int i=0;i<N;i++){
        if(P[likes[i]]==0)
          System.out.println("BeiJu");
        else
          System.out.println(P[likes[i]]);
      }
    }
  }
}