Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() (int, error) {
	return strconv.Atoi(nextString())
}

type Pair struct {
	key   int
	value int
}

func main() {
	scanner.Split(bufio.ScanWords)

	counts := map[int]int{}
	for {
		n, err := nextInt()
		if err != nil {
			break
		}

		counts[n]++
	}

	pairs := []Pair{}
	for k, v := range counts {
		pairs = append(pairs, Pair{k, v})
	}
	sort.Slice(pairs, func(i, j int) bool {
		if pairs[i].value == pairs[j].value {
			return pairs[i].key < pairs[j].key
		}
		return pairs[i].value > pairs[j].value
	})

	vMax := 0
	for _, pair := range pairs {
		if vMax != 0 && vMax != pair.value {
			break
		}
		if pair.value > vMax {
			vMax = pair.value
		}
		fmt.Println(pair.key)
	}
}

Python: # 0028
array = []
while True:
    try:
        a = input()
        array.append(int(a))
    except EOFError:
        break
s = set(array)
mx = array.count(max(s, key = array.count))
for a in sorted(s):
    if array.count(a) == mx:
        print(a)

Python: # 0028
import collections
array = []
while True:
    try:
        a = input()
        array.append(int(a))
    except EOFError:
        break
count = list(map(lambda a: array.count(a), array))
modes = list(set(filter(lambda a: array.count(a) == max(count), array)))
print(*modes, sep = '\n')

Python: #(50)最頻値

a=[]
try:
    while True:
        a.append(int(input()))

except EOFError:
    pass

counts=[0]*101

for n in a:
    counts[n]+=1
    
for n in range(len(a)):
    if counts[n]==max(counts):
        print(n)

Python: while True:
    try:
        alist = []
        while True:
            try:
                a = int(input())
                alist.append(a)
                
            except:
                break
    
        m = min(alist)
        M = max(alist)
        
        if m<1:
            break

        clist = [0]
        saihin = [0]
        for i in range(m,M+1,1):
            c = alist.count(i)
            if c>clist[0]:
                del(clist[0])
                clist.append(c)
                del(saihin[0])
            if c==clist[0]:
                saihin.append(i)

        l = len(saihin)
        for i in range(l):
            if saihin==[]:
                break
            print(saihin[0])
            del(saihin[0])
    
    except:
        break

Python: # coding: utf-8
# Your code here!

a = list([0] * 100)

while True :
    try :
        a[int(input())-1] += 1
    except EOFError :
        break
    
x = max(a)
for i in range(100) :
    if a[i] == x :
        print(i+1)

Python: n=[0]*101
while 1:
    try:n[int(input())]+=1
    except:break
m_n=max(n)
for i in range(n.count(m_n)):
    print(n.index(m_n)+i)
    n.remove(m_n)

Python: import sys
a={}
for i in sys.stdin:a.setdefault(i,0);a[i]+=1
[print(k.strip())for k in a if a[k]==max(a.values())]

Python: a = []
while True:
    try:
        a.append(int(input()))
    except:
        break
counts = [0] * 101
for i in a:
    counts[i] = counts[i] + 1
for i in range(len(a)):
    if counts[i] == max(counts):
        print(i)

Python: #数字の数を求めるためのリストを作成する
num_list = [0 for i in range(101)]

#"EOFError"がくるまで入力を繰り返し、入力の番号のインデックスを1ふやす
try:
    while True:
        num_list[int(input())] += 1
except EOFError:
    
    #最瀕値の数が出てきた数を変数に代入し最瀕値であれば出力する
    i = max(num_list)
    for j in range(1,101):
        if num_list[j] == i:print(j)

Python: # 0028
array = []
while True:
    try:
        a = input()
        array.append(int(a))
    except EOFError:
        break
s = set(array)
mx = array.count(max(array, key = array.count))
for a in sorted(s):
    if array.count(a) == mx:
        print(a)

Python: a=[]
try:
    while True:
        a.append(int(input()))
except EOFError:
    pass

count=[0]*101
for n in a:
    count[n]+=1

for n in range(len(a)):
    if count[n]==max(count):
        print(n)

Python: import sys
from collections import Counter
v = Counter([int(i) for i in sys.stdin.readlines()]).most_common()
j = [print(i) for i in sorted([k for k, l in v if l == v[0][1]])]

Python: # -*- coding: utf-8 -*-

DICT = {k: 0 for k in range(0, 10)}


def solve(d):
    l = []
    _max = max(d.values())
    for k, v in d.items():
        if _max == v:
            l.append(k)
    print('\n'.join(str(e) for e in l), end='')

if __name__ == '__main__':
    while True:
        try:
            n = int(input())
            DICT[n] += 1
        except:
            break

    solve(DICT)

Python: import operator
h = {}   
while True:
    try:
        i = int(input())
        if i in h:
            h[i] += 1
        else:
            h[i] = 0
    except EOFError:
        break

h1=sorted(h.items(),key=operator.itemgetter(1),reverse=1)
val = h1[0][1]
h2 = sorted(filter(lambda x:x[1]==val, h1))
for i in h2:
    print(i[0])

Python: # AOJ 0028 Mode Value
# Python3 2018.6.13 bal4u

import sys

cnt = [0]*101
while True:
	try:
		cnt[int(input())] += 1
	except EOFError:
		break
    	
max = max(cnt)
for i in range(101):
	if cnt[i] == max:
		print(i)

Python: a=[]
try:
      while True:
            a.append(int(input()))
except EOFError:
      pass
counts=[0]*101
for n in a:
      counts[n]+=1
for n in range (len(a)):
      if counts[n]==max(counts):
            print(n)

Python: # coding=utf-8

###
### for atcorder program
###

import sys
import math

# math class
class mymath:
    ### pi
    pi = 3.14159265358979323846264338

    ### Prime Number
    def pnum_eratosthenes(self, n):
        ptable = [0 for i in range(n+1)]
        plist = []

        for i in range(2, n+1):
            if ptable[i]==0:
                plist.append(i)
                for j in range(i+i, n+1, i):
                    ptable[j] = 1
        return plist

    ### GCD
    def gcd(self, a, b):
        if b == 0:
            return a
        return self.gcd(b, a%b)

    ### LCM
    def lcm(self, a, b):
        return (a*b)//self.gcd(a,b)

    ### Mat Multiplication
    def mul(self, A, B):
        ans = []
        for a in A:
            c = 0
            for j, row in enumerate(a):
                c += row*B[j]
            ans.append(c)
        return ans

mymath = mymath()

### output class
class output:
    ### list
    def list(self, l):
        l = list(l)
        #print(" ", end="")
        for i, num in enumerate(l):
            print(num, end="")
            if i != len(l)-1:
                print(" ", end="")
        print()

output = output()

### input sample
#i = input()
#N = int(input())
#A, B, C = [x for x in input().split()]
#N, K = [int(x) for x in input().split()]
#inlist = [int(w) for w in input().split()]

#R = float(input())
#A.append(list(map(int,input().split())))

#for line in sys.stdin.readlines():
#    x, y = [int(temp) for temp in line.split()]

#abc list
#abc = [chr(ord('a') + i) for i in range(26)]

### output sample
#print("{0} {1} {2:.5f}".format(A//B, A%B, A/B))
#print("{0:.6f} {1:.6f}".format(R*R*math.pi,R*2*math.pi))
#print(" {}".format(i), end="")

def get_input():
    N = []
    while True:
        try:
            #N.append(input())
            N.append(int(input()))
        except EOFError:
            break
    return N

A = get_input()

N = []
maxnum = -1

for i in A:
    count = 0
    for j in A:
        if i == j:
            count += 1
    if maxnum < count:
        maxnum = count
        N = [i]
    elif maxnum == count:
        N.append(i)

N = set(N)
N = sorted(N)

for i in N:
    print(i)

Python: from sys import stdin
from collections import Counter
data = Counter([i for i in range(1, 101)])
for line in stdin:
    data[int(line.replace('\n', ''))] += 1
mode = data.most_common(1)[0][1]

for po in range(1, 101):
    if data[po] == mode:
        print(po)
    else:
        pass