Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #define N 3
- #define M 3
- int getMaxNeighbourSum(int matrix[N][M], int row, int col) {
- int maxSum = 0;
- int i, j;
- for (i = row - 1; i <= row + 1; i++) {
- for (j = col - 1; j <= col + 1; j++) {
- if (i >= 0 && i < N && j >= 0 && j < M && !(i == row && j == col)) {
- maxSum = (matrix[i][j] > maxSum) ? matrix[i][j] : maxSum;
- }
- }
- }
- return maxSum;
- }
- int main() {
- int matrix[N][M] = {
- {1, 2, 3},
- {4, 5, 6},
- {7, 8, 9}
- };
- int maxNeighbourSum = getMaxNeighbourSum(matrix, 1, 1);
- printf("Максималният сбор на околните числа е: %d\n", maxNeighbourSum);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement