C :

#include<stdio.h>
int a[20]; 
int main() 
{
    int i,x;
    for(i = 1;i <= 50;i++)
	{
	    scanf("%d",&x);
	    a[x]++;
	}
	int max=a[0];
	for(i=0;i<=19;i++)
	{
		if(a[i]>max)
		{
			max=a[i];
		}
	}
	printf("%d",max);
}

C++ :

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int a[50],n=50,max,num,c=0;
    for (int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    for (int i=1;i<n;i++)
    {
    	for (int j=0;j<n-i;j++)
    	{
    		if (a[j]>a[j+1]) swap(a[j],a[j+1]);
		}
	}
	/*for (int i=0;i<n;i++)
	{
		cout<<a[i]<<" ";
	}*/
	max=0;
	for (int i=0;i<n;i++)
	{
		c++;
		if (i==n-1||a[i]!=a[i+1])
		{
			
			//cout<<a[i]<<":"<<c<<endl;
			if (c>max)
			{
				max=c;
				num=a[i];
			}
			c=0;
		}
		
	}
	cout<<max<<endl;
    return 0;
}
 

Pascal :

var a,b:array[1..100000] of longint;
    i,max:longint;
begin
for i:=1 to 50 do
read(a[i]);
for i:=1 to 50 do
b[a[i]]:=b[a[i]]+1;
for i:=1 to 50 do
if b[a[i]]>max then max:=b[a[i]];
write(max);
end.

Java :

import java.util.Scanner;
public class Main{
	public static void main(String[] args) {
		Scanner scanner=new Scanner(System.in);
		String numbers=scanner.nextLine();
		String[] numberArray=numbers.split(" ");
		int count_Max=0;
		for(int i=0;i<numberArray.length;i++){
			int num=Integer.valueOf(numberArray[i]);
			int count=0;
			for(int j=0;j<numberArray.length;j++){
				if(Integer.valueOf(numberArray[j])==num){
					count++;
				}
			}	
			if(count>=count_Max){
				count_Max=count;
			}
		}
		System.out.println(count_Max);
	}
}

Python :

li=[]
for i in range (0,20):
    li.append(0)
li02 = list(map(int,input().split()))
for i in li02:

    li[i] += 1

print(max(li))