C :

#include <stdio.h>
#include <malloc.h>
void main()
{
 int n,*a,i,j,p,zhongshu,chongshu=0;
 scanf("%d",&n);
 a=(int *)malloc(sizeof(int)*n);
 for(i=0;i<n;i++)
  scanf("%d",&a[i]);
 zhongshu=a[0];
 for(i=0;i<n;i++)
 {
  for(j=0;j<i;j++)
   if(a[j]==a[i])
    break;
  if(j!=i)
   continue;
  p=0;
  for(j=i;j<n;j++)
   if(a[j]==a[i])
    p++;
  if(p>chongshu)
  {
   chongshu=p;
   zhongshu=a[i];
  }
 }
 printf("%d\n%d\n",zhongshu,chongshu);
 free(a);
}

C++ :

#include<iostream>
using namespace std;
void search(int b[],int j){
	int c[100]={0};
for(int k=0;k<j;k++){
	for( int m=k+1;m<=j;m++){
	if(b[k]==b[m])
		c[k]+=1;
}
}
int max=c[0];
for(int n=0;n<=j;n++)
{
	if(c[n]>=max)
		max=c[n];
}
for(int l=0;l<=j;l++)
{
	if(c[l]==max)
		cout<<b[l]<<"\n"<<max+1;
}
}
int  main(){
	int a[100],i,p=0;
  cin>>i;
  while(p<i){
      cin>>a[p];
    p++;
  }
		
	search(a,p);
}

Java :

import java.util.*;
public class Main {
	public static void main(String [] args)
	{
		int x=0,y=0;
		Scanner in=new Scanner(System.in);
		int []array = null;
		int []b = null;
		int n=in.nextInt();
		array=new int[n];
		b=new int[n];
		for(int m=0;m<n;m++)
		{
			array[m]=in.nextInt();
			b[m]=1;
		}
		for(int i=0;i<n;i++)
		{
			int j=0;
			for(j=i+1;j<n;j++)
			{
				if(array[i]==array[j])
					b[i]++;
			}	
			if(b[i]>x)
			{
				x=b[i];
				y=array[i];
			}
		}
		System.out.println(y);
		System.out.println(x);
	}

}