Go: package main

import (
	"fmt"
	"sort"
)

func main() {
	var max int

	numbers := map[int]int{}
	for {
		var a int
		_, err := fmt.Scan(&a)
		if err != nil {
			break
		}
		numbers[a]++
		if numbers[a] >= max {
			max = numbers[a]
		}
	}

	var modes []int
	for a, b := range numbers {
		if b == max {
			modes = append(modes, a)
		}
	}

	sort.Ints(modes)
	for _, mode := range modes {
		fmt.Println(mode)
	}
}

C++: 
#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <utility>
#include <complex>
#include <stack>
#include <climits>

using namespace std;

double sq(double x){return x*x;}

int t[100];

int main(){
	int x;
	while(cin>>x){
		t[x-1]++;
	}
	int m = *max_element(t,t+100);
	for (int i = 0; i < 100; i++)
	{
		if(m == t[i]) cout << i+1 << endl;
	}

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
    vector<int> data(101);
    int n;
    while (cin >> n && n) {
        data[n] ++;
    }

    int maxn = *max_element(data.begin(), data.end());
    for (int i=0; i<101; ++i) {
        if (data[i] == maxn) {
            cout << i << endl;
        }
    }

    return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
        const int MAX = 101;
        int num[MAX];
        for (int i = 1; i < MAX; i++) {
                num[i] = 0;
        }
        int a;
        while (cin >> a) {
                num[a]++;
        }
        int cnt = 0, max = 0;
        int mode[100];
        for (int i = 1; i < MAX; i++) {
                max = (max < num[i]) ? num[i] : max;
        }
        for (int i = 1; i < MAX; i++) {
                if (num[i] == max) {
                        mode[cnt++] = i;
                }
        }
        for (int i = 0; i < cnt; i++) {
                cout << mode[i] << endl;
        }

        return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <fstream>
#include <set>
#include <utility>

using namespace std;
int main() {
	vector<int> v(100,0);
	int n;
	while (cin >> n) {
		v[n - 1]++;
	}

	int max = 0;
	for (int i = 0; i < 100; i++) {
		if (max < v[i]) max = v[i];
	}

	for (int i = 0; i < 100; i++) {
		if (v[i] == max) cout << i + 1 << endl;
	}
	
	
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main(){
  vector<pair<int,int>> cnt(101);

  for(int i=1; i<=100; i++) cnt[i] = make_pair(0, i);

  int x;
  while(cin >> x) cnt[x].first++;

  sort(cnt.begin()+1, cnt.end());

  int maximum = cnt[100].first;
  for(int i=1; i<=100; i++){
    if(cnt[i].first == maximum){
      cout << cnt[i].second << endl;
    }
  }
}

C++: #include <iostream>
#include <algorithm>

using namespace std;

int main() {
	int d[101] = { 0 }, a, m = 0;
	while (cin >> a){
		d[a]++;
		m = max(m, d[a]);
	}
	for (int i = 1; i <= 100; i++){
		if (m == d[i])cout << i << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a[10000]={0};
int s,sai,ans=0,c=0;
while(cin>>s){
a[s]++;
c++;
}
for(i=0;i<c;i++){
if(a[i]>ans){
ans=a[i];
sai=i;
}
cout<<sai<<endl<<ans<<endl;
return 0;
}

C++: #include <iostream>
#include <map>
#include <queue>

using namespace std;

int main() {
  map<int, int> m;
  priority_queue<pair<int, int> > que;
  int n;
  while (cin >> n) {
    m[n]++;
  }
  for (map<int, int>::iterator it = m.begin(); it != m.end(); it++) {
    que.push(pair<int, int>(it->second, it->first));
  }
  priority_queue<int, vector<int>, greater<int> > result;
  pair<int, int> maxi = que.top(); que.pop();
  result.push(maxi.second);
  while (!que.empty()) {
    pair<int, int> n = que.top(); que.pop();
    if (maxi.first == n.first) {
      result.push(n.second);
    } else {
      break;
    }
  }
  while (!result.empty()) {
    cout << result.top() << endl;
    result.pop();
  }

  return 0;
}

C++: #define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<list>
#include<stack>
#include<queue>
#include<cctype>
#include<iomanip>
#include<functional>
#include<numeric>
#define EPS 1e-10
using namespace std;
typedef long long llong;
int main() {
	int n;
	int a[101] = {};
	int max = 0;
	while (cin >> n) {
		a[n]++;
		if (max < a[n])max = a[n];
	}
	for (int i = 0; i < 101; i++)if(max==a[i])cout << i << endl;
	return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main(){
	int a[101] = {0};
	int input;
	while(cin >> input){
		a[input]++;
		int m = 0;
		for(int i = 1; i < 101; i++){
			if(m < a[i]) m = a[i];
			//m = max(m, a[i]);
		}
		for(int i = 1; i < 101; i++){
			if(m == a[i]){
				cout << i << endl;
			}
		}
	}
	return 0;
}

C++: #include<iostream>
#include<vector>
using namespace std;

int main()
{
	vector<int> N(101);
	int n,max=0;

	while (cin >> n){
		N[n]++;
	}

	for (int i = 0; i<N.size(); ++i){
		if (N[i] != 0)	{
			if (N[i] > max){
				max = N[i];
			}
		}
	}

	for (int i = 0; i < 100; ++i){
		if (N[i] == max)
			cout << i << endl;
	}

	return 0;
}

C++: #include <iostream>
#include <algorithm>

#define MAXINUM   ( 100 + 1 )

using namespace std;

/** Application main entry point. */
int main (
  int     argc,
  char  * argv[ ]
  )
{
  int input[ MAXINUM ] = { 0 };
  int countMax = 0;

  do
  {
    int __tmp;
    
    cin >> __tmp;
    countMax = max ( countMax, ++input[ __tmp ] );
  }
  while ( !cin.eof ( ) );

  for ( int i = 0; i < MAXINUM; ++i )
  {
    if ( input[ i ] == countMax )
    {
      cout << i << endl;
    }
  }

  return ( 0 );
}

C++: #include <iostream>
#include <iomanip>
#include <cassert>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <sstream>
#include <istream>
#include <cmath>
#include <cstdio>

using namespace std;

#define vci vector<int>
#define vcs vector<string>
#define pb push_back
#define sz size()
#define mapii map<int, int>
#define mapci map<char, int>
#define mapsi map<string, int>
#define all(x) x.begin(), x.end()
#define minit(a, i) memset(a, i, sizeof(a));

#define for_(i, a, b) for (int i=(int)a; i<(int)b; i++)
#define for_d(i, a, b) for (int i=(int)a-1; i>=b; i--)
#define for_r(i, a, b, c) for (int i=(int)a; i<(int)b; i += c)
#define for_dr(i, a, b, c) for (int i=(int)a-1; i>=b; i -= c)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

typedef long long ll;

const int iINF = 2147483647;
const ll lINF = 9223372036854775807;

template <class T> inline void dbg(T t) { cout << t << endl; }


int main() {
	int a[110]; minit(a, 0);
	int in, maxl = 0;
	while (cin>>in) { a[in]++; maxl = max(maxl, a[in]); }
	for_(i, 0, 110) if (a[i]==maxl) cout << i << endl;
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int sum[101],n,mx,cou;
int main(){
    while(cin>>n){
        sum[n]++;
    }
    for(int i=0;i<100;i++)mx=max(mx,sum[i]);
    for(int i=0;i<100;i++){
        if(mx==sum[i]){
            if(cou==0){
                cout<<i;
                cou++;
            }else cout<<" "<<i;
        }
    }
    cout<<endl;
return 0;
}

C++: #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
    int n;
    map<int, int> numbers;
    while (cin >> n) {
        numbers[n]++;
    }
    int maxMode = 0;
    vector<int> maxNumber;
    for (map<int,int>::iterator it=numbers.begin(); it != numbers.end(); ++it) {
        if (it->second > maxMode) {
            maxMode = it->second;
            maxNumber.clear();
            maxNumber.push_back(it->first);
        }
        else if (it->second == maxMode) {
            maxMode = it->second;
            maxNumber.push_back(it->first);
        }
    }
    for (int i = 0; i != maxNumber.size(); ++i) {
        cout << maxNumber[i] << endl;
    }
    return 0;
}