Răspuns :
#include <iostream>
using namespace std;
int n, m, poz, newpoz, Max, nrMax, v[100][100];
int placinta[2][10005];
int cauta(int val)
{
for(int i=1; i<=poz; i++)
if(val == placinta[0][i])
return i;
return 0;
}
int main()
{
cin >> n >> m;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++) {
cin >> v[i][j];
if(!(newpoz = cauta(v[i][j]))) {
placinta[0][++poz] = v[i][j];
placinta[1][poz] = 1;
}
else {
placinta[1][newpoz]++;
if(placinta[1][newpoz] >= Max) {
Max = placinta[1][newpoz];
if(placinta[0][newpoz] > nrMax)
nrMax = placinta[0][newpoz];
}
}
}
cout << "Numarul cu cele mai multe aparitii este: " << nrMax << '\n';
return 0;
}
using namespace std;
int n, m, poz, newpoz, Max, nrMax, v[100][100];
int placinta[2][10005];
int cauta(int val)
{
for(int i=1; i<=poz; i++)
if(val == placinta[0][i])
return i;
return 0;
}
int main()
{
cin >> n >> m;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++) {
cin >> v[i][j];
if(!(newpoz = cauta(v[i][j]))) {
placinta[0][++poz] = v[i][j];
placinta[1][poz] = 1;
}
else {
placinta[1][newpoz]++;
if(placinta[1][newpoz] >= Max) {
Max = placinta[1][newpoz];
if(placinta[0][newpoz] > nrMax)
nrMax = placinta[0][newpoz];
}
}
}
cout << "Numarul cu cele mai multe aparitii este: " << nrMax << '\n';
return 0;
}