Question

Se considera tabloul A[1...n, 1...n], n mai mic sau egal ca 100 de numere reale distincte.Scrieti un program care determina linia care contine elementul cu valoare maxima.

Answer 1

#include <iostream>

using namespace std;

int main()
{
int n, m, a[100][100];
cin >> n >> m;
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
cin >> a[i][j];
int maxi = 0;
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
if(a[i][j] > maxi)
maxi = a[i][j];
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
if(a[i][j] == maxi)
cout << i << endl;
return 0;
}