Advertisement
savovaap_

Untitled

May 15th, 2023
920
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.74 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. #define N 3
  4. #define M 3
  5.  
  6. int getMaxNeighbourSum(int matrix[N][M], int row, int col) {
  7.     int maxSum = 0;
  8.     int i, j;
  9.  
  10.     for (i = row - 1; i <= row + 1; i++) {
  11.         for (j = col - 1; j <= col + 1; j++) {
  12.             if (i >= 0 && i < N && j >= 0 && j < M && !(i == row && j == col)) {
  13.                 maxSum = (matrix[i][j] > maxSum) ? matrix[i][j] : maxSum;
  14.             }
  15.         }
  16.     }
  17.  
  18.     return maxSum;
  19. }
  20.  
  21. int main() {
  22.     int matrix[N][M] = {
  23.         {1, 2, 3},
  24.         {4, 5, 6},
  25.         {7, 8, 9}
  26.     };
  27.  
  28.     int maxNeighbourSum = getMaxNeighbourSum(matrix, 1, 1);
  29.  
  30.     printf("Максималният сбор на околните числа е: %d\n", maxNeighbourSum);
  31.  
  32.     return 0;
  33. }
  34.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement