//  1. 4 лаба. задача 19
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>


int main()
{
    int const N = 9;
    int arr[N][N] = {0};
    int i, j, max;
    int sum = 0;

    randomize();
    printf("Matrix:\n");
    for(i = 0 ; i < N ; i++){
        for(j = 0 ; j < N ; j++){
           arr[i][j] = rand()%100;
           printf("%i\t",arr[i][j]);
        }
        printf("\n");
    }

    printf("\n\nResult:\n");
    max = arr[0][0];
    for(i = 0 ; i < N ; i++){
        for(j = 0 ; j < N ; j++){

            if(  i < N/2 && j <= i ||
                 i >= N/2 && j <= N - 1 - i ||
                 i < N/2 && j >= N - 1 - i ||
                 i >= N/2 && j >= i
              ){
                 max = (arr[i][j] > max)? arr[i][j] : max;
                 sum+=arr[i][j];
              }
              else
                arr[i][j] = 0;
             printf("%i\t",arr[i][j]);
        }
        printf("\n");
    }

    printf("\nSumma: %i\nMax: %i",sum, max);


    getch();
    return 0;
}