Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	table := make([]int, 100)
	now := 0
	max := 0
	for i := range table {
		table[i] = 0
	}
	for scanner.Scan() {
		now, _ =strconv.Atoi(scanner.Text())
		table[now-1]++
		if table[now-1] > max {
			max = table[now-1]
		}
	}
	for i := 0; i < 100; i++ {
		if table[i] == max {
			fmt.Println(i+1)
		}
	}
}

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

Python: a=[]
while True:
    try:
        x=int(input())
        a.append(x)
    except:
        break
b=[]
for i in range(1,101):
    y=a.count(i)
    b.append(y)
c=[j for j, v in enumerate(b) if v == max(b)]
e=len(c)
for h in range(e):
    print(c[h]+1)

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

cnt = [0] * 101
for i in A:
    cnt [i] += 1

mx = max(cnt)

for i in range(1,101):
    if cnt [i] == mx:
        print(i)

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

Python: import collections
import sys
cntr = collections.Counter()
for line in sys.stdin:
    cntr[int(line)] += 1
lst = []
for k,v in cntr.items():
    lst.append((v,k))
lst.sort()
t = len(lst)-1
while t>0 and lst[t][0] == lst[t-1][0]:
    t -= 1
for i in range(t,len(lst)):
    print(lst[i][1])

Python: memo, max_value = {}, 0
while True :
    try :
        temp = input()
        if temp in memo : memo[temp] = memo[temp] + 1
        else : memo[temp] = 1
        if max_value < memo[temp] : max_value = memo[temp]
    except : break
temp = []
for result, value in memo.items() :
    if max_value == value : temp.append(result)
temp.sort()
for _ in temp : print(_)

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: x=[]
while True:
    try:
        n=int(input())
        x.append(n)
    except:
        break

c=[0]*101
for i in x:
    c[i]+=1
b=max(c)

for j in range(100):
    if c[j]==b:
        print(j)

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

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


def solve(d):
    l = []
    _max = max(d.values())
    for k, v in sorted(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: a=[0]*100
while 1:
  try:
    a[int(input())-1]+=1
  except:
    break
[print(i+1)for i in range(100)if a[i]==max(a)]

Python: import sys

d = {i:0 for i in range(1,101)}
for i in map(int, sys.stdin):
    d[i] += 1
s = sorted(d.items(), key=lambda x: x[1], reverse=True)
m = s[0][1]
for i in s:
    if i[1] < m:
        break
    print(i[0])

Python: 
a = [0]*101

while True:
    try:
        n = int(input())
        a[n] += 1
    except:
        break
    
for i in range(1,101):
    if a[i] == max(a):
        print(i)

Python: l=[0]*101
while True:
    try:
        i=int(input())
        l[i]+=1
    except:
        break
M=max(l)
for j in range(1,101):
    if l[j]==M:
        print(j)
    else:
        pass

Python: import sys

count = [0 for _ in range(101)]
mode = [0]

for s in sys.stdin:
    x = int(s)
    count[x] += 1

for i in range(len(count)):
    if count[i] > mode[0]:
        mode.clear()
        mode.append(i)
    elif count[i] == mode[0]:
        mode.append(i)

for i in mode:
    print(i)

Python: import collections
a = []
while True:
    try:
        n = int(input())
    except EOFError:
        break
    a.append(n)
    
if len(a) != 0:
    b = collections.Counter(a)
    c = b.most_common()
    x = c[0][1]
    d = []
    for elem in c:
        if elem[1] == x:
            d.append(elem[0])
        else:
            break
    d.sort()
    [print(k) for k in d]

Python: # 0028
import collections
array = [0]*100
i = 0
while True:
    a = input()
    if a == '': break
    array[i] = int(a)
    i += 1
array = filter(lambda a: a != 0, array)
counter = collections.Counter(array).most_common()
for a, count in counter:
    if count < counter[0][1]: break
    print(a)

Python: a = [0] * 101
while True:
    try:
        a[int(input())] += 1
    except:
        break
maxv = max(a)
for i, v in enumerate(a):
    if maxv == v:
        print(i)

Python: lst=[]
while True:  
    try:
        n=int(input())
        lst.append(n)
    except EOFError:
        break
        continue
import collections
c = collections.Counter(lst)  
freqCheck = c.most_common()
mode =[freqCheck[0][0]]
maxCount = freqCheck[0][1] 
count = 1
while maxCount == freqCheck[count][1]:
    mode.append(freqCheck[count][0])
    count = count + 1
mode.sort()
for i in mode:
    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 -*-

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


def solve(d):
    _max = max(d.values())
    for k, v in d.items():
        if _max == v:
            print(k)

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

    solve(DICT)

Python: a=[]
c=[]
while True:
    try:
        a.append(int(input()))
    except:
        break
x=len(a)
for i in range(x):
    b=a.count(i)
    c.append(b)
r=max(c)
e=len([i for i,x in enumerate(c) if x==r])
d=[i for i,x in enumerate(c) if x==r]
for i in range(e):
    print(d[i])

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())]