Sure, here is a Python solution for your problem:

```python
def sum_rows(A, B):
N = len(A)
M = len(B[0])
result = [[0]*M for _ in range(N)]

for i in range(N):
for j in range(M):
result[i][j] = A[i][j] + B[N-i-1][j]

return result
```

This function `sum_rows` takes two 2D lists `A` and `B` as input, which represent the matrices. The function first initializes a new 2D list `result` with the same dimensions as `A` and `B`, filled with zeros.

Then it iterates over each row `i` and each column `j` of the matrices. For each cell, it adds the value from the `i`-th row of `A` and the `(N-i-1)`-th row of `B`, and stores the result in the corresponding cell of `result`.

Finally, it returns the `result` matrix, which contains the sums of the corresponding rows from `A` and `B`.

Please note that this solution assumes that `A` and `B` have the same dimensions, as per the problem statement. If they don't, you'll need to add some error checking code to handle this case.

Question

Sure, here is a Python solution for your problem:

```python
def sum_rows(A, B):
    N = len(A)
    M = len(B[0])
    result = [[0]*M for _ in range(N)]
    
    for i in range(N):
        for j in range(M):
            result[i][j] = A[i][j] + B[N-i-1][j]
    
    return result
```

This function `sum_rows` takes two 2D lists `A` and `B` as input, which represent the matrices. The function first initializes a new 2D list `result` with the same dimensions as `A` and `B`, filled with zeros.

Then it iterates over each row `i` and each column `j` of the matrices. For each cell, it adds the value from the `i`-th row of `A` and the `(N-i-1)`-th row of `B`, and stores the result in the corresponding cell of `result`.

Finally, it returns the `result` matrix, which contains the sums of the corresponding rows from `A` and `B`.

Please note that this solution assumes that `A` and `B` have the same dimensions, as per the problem statement. If they don't, you'll need to add some error checking code to handle this case.

Knowee AI · Accepted Answer

Sure, here is a Python solution for your problem:

```python
def sum_rows(A, B):
    N = len(A)
    M = len(B[0])
    result = [[0]*M for _ in range(N)]
    
    for i in range(N):
        for j in range(M):
            result[i][j] = A[i][j] + B[N-i-1][j]
    
    return result
```

This function `sum_rows` takes two 2D lists `A` and `B` as input, which represent the matrices. The function first initializes a new 2D list `result` with the same dimensions as `A` and `B`, filled with zeros.

Then it iterates over each row `i` and each column `j` of the matrices. For each cell, it adds the value from the `i`-th row of `A` and the `(N-i-1)`-th row of `B`, and stores the result in the corresponding cell of `result`.

Finally, it returns the `result` matrix, which contains the sums of the corresponding rows from `A` and `B`.

Please note that this solution assumes that `A` and `B` have the same dimensions, as per the problem statement. If they don't, you'll need to add some error checking code to handle this case.

Print the sum of row 1 of A and row N of B, row 2 of A and row (N-1) of B and so on.Constraints1 <= N, M <= 100-102 <= mat[i][j] <= 102

Question

Solution

Similar Questions

Upgrade your grade with Knowee