Răspuns:
#include<iostream>
using namespace std;
int f[1000001],v[101][101], n, m, mxap, nr;
void aparitii(int f[1000000])
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
{
cin>>v[i][j];
f[v[i][j]]++;
}
}
}
int main()
{
cin>>n>>m;
aparitii(f);
for(int i = 1; i <= 1000000; i++)
{
if(f[i] != 0 && f[i] > mxap)
{
mxap = f[i];
}
}
for(int i = 1; i <= 1000000; i++)
{
if(f[i] != 0 && f[i] == mxap)
{
cout<<i<<" ";
}
}
return 0;
}
Explicație: