it is the question about programming C++ language

Question

Take a Boolean 2D array of 10X 10, where each row is sorted from the user, Find the row with the

maximum number of 1s.

Example:

Input matrix

0 1 1 1

0 0 1 1

1 1 1 1 // this row has maximum 1s

0 0 0 0

Output: 2

Answer 1

using namespace std;

#include <iostream>

void Input(int A[][10],int* n)

{

int x;

int N=11;

while (N>10 || N<0)

{

cout << "How many rows/columns ??? :>";

cin >> N;

}

*n = N;

for (int rowLoop=0; rowLoop<N; rowLoop++)

{

for (int columnLoop=0; columnLoop<N; columnLoop++)

{

x=-1;

while (x!=0 && x!=1)

{

cout << " Cell " << rowLoop << " " << columnLoop << " :>";

cin >> x;

}

A[rowLoop][columnLoop]=x;

}

}

}

int Count(int A[][10],int n)

{

int rowTotal=0;

int maxRowTotal=0;

int rowNumOfMax=-1;

for (int iLoop=0; iLoop<n; iLoop++)

{

rowTotal=0;

for (int jLoop=0; jLoop<n; jLoop++)

{

rowTotal += A[iLoop][jLoop];

}

if (rowTotal>maxRowTotal)

{

maxRowTotal = rowTotal;

rowNumOfMax = iLoop;

}

}

return(rowNumOfMax);

}

int main()

{

int A[10][10];

int n;

Input(A,&n);

int iMaxRow = Count(A,n);

cout << iMaxRow << endl;

}

Answer 2

I answered your other question in Python. C++ would be something like this. Note that since you know it will be a 10x10 array you can skip the part where we figure out those dimensions from the input.

#include <iostream>

using namespace std;

int arr[][4] = {{0, 1, 1, 1},{0, 0, 1, 1},{1, 1, 1, 1},{0, 0, 0, 0}};

int main() {

int highest_count = 0;

int highest_index = 0;

int rows = sizeof(arr) / sizeof(arr[0]);

int cols = sizeof(arr) / (sizeof(int) * rows);

for (int x = 0; x < rows; x++) {

int counter = 0;

for (int y = 0; y < cols; y++) {

if (arr[x][y]) {

counter++;

}

}

if (counter > highest_count) {

highest_count = counter;

highest_index = x;

}

}

cout << "Highest count at index " << highest_index << " with " << highest_count << endl;

}