#include <iostream>
#include <cstdlib>
#include <ctime>
#include <iomanip>

using namespace std;

const short N = 6;

int main()
{
    double tablica[N][N];
    srand(time(nullptr));

    cout << setprecision(4);

    for(short i = 0; i < N; ++i)
    {
        for(short j = 0; j < N; ++j)
        {
            tablica[i][j] = 10.0 * rand() / RAND_MAX;
            cout << tablica[i][j] << '\t';
        }
        cout << endl;
    }
    cout << endl;

    // Wyszukiwanie dwoch najwiekszych liczb na przekatnych:
    short i1 = 0, i2 = N-1, j1 = 0, j2 = 0;
    if(tablica[i2][j2] > tablica[i1][j1])
        swap(i1, i2);
    for(short i = 1; i < N; ++i)
    {
        if(tablica[i][i] > tablica[i1][j1])
        {
            i2 = i1;
            j2 = j1;
            i1 = i;
            j1 = i;
        }
        else if(tablica[i][i] > tablica[i2][j2])
        {
            i2 = i;
            j2 = i;
        }
        if(tablica[i][N - i - 1] > tablica[i1][j1])
        {
            i2 = i1;
            j2 = j1;
            i1 = i;
            j1 = N - i - 1;
        }
        else if(tablica[i][N - i - 1] > tablica[i2][j2])
        {
            i2 = i;
            j2 = N - i - 1;
        }
    }
    cout << "Najwieksze liczby na przekatnych: " << tablica[i1][j1] << " i " << tablica[i2][j2] << endl << endl;
    tablica[i1][j1] = 0;
    tablica[i2][j2] = 0;

    // wyszukanie dwóch najmniejszych wartości na obwodzie:
    i1 = 0;
    j1 = 0;
    i2 = 0;
    j2 = 1;

    if(tablica[i2][j2] < tablica[i1][j1])
        swap(j2, j1);
    // pierwszy wiersz:
    for(short j = 2; j < N; ++j)
    {
        if(tablica[0][j] < tablica[i1][j1])
        {
            i2 = i1;
            j2 = j1;
            i1 = 0;
            j1 = j;
        }
        else if(tablica[0][j] < tablica[i2][j2])
        {
            i2 = 0;
            j2 = j;
        }
    }

    // ostatni wiersz:
    for(short j = 0; j < N; ++j)
    {
        if(tablica[N - 1][j] < tablica[i1][j1])
        {
            i2 = i1;
            j2 = j1;
            i1 = N - 1;
            j1 = j;
        }
        else if(tablica[N - 1][j] < tablica[i2][j2])
        {
            i2 = N - 1;
            j2 = j;
        }
    }

    // pierwsza kolumna:
    for(short i = 1; i < N - 1; ++i)
    {
        if(tablica[i][0] < tablica[i1][j1])
        {
            i2 = i1;
            j2 = j1;
            i1 = i;
            j1 = 0;
        }
        else if(tablica[i][0] < tablica[i2][j2])
        {
            i2 = i;
            j2 = 0;
        }
    }

    // ostatnia kolumna:
    for(short i = 1; i < N - 1; ++i)
    {
        if(tablica[i][N - 1] < tablica[i1][j1])
        {
            i2 = i1;
            j2 = j1;
            i1 = i;
            j1 = N - 1;
        }
        else if(tablica[i][N - 1] < tablica[i2][j2])
        {
            i2 = i;
            j2 = N - 1;
        }
    }

    cout << "Dwie najmniejsze liczby na obwodzie wynosza " << tablica[i1][j1] << " i " << tablica[i2][j2] << endl << endl;

    double suma = tablica[i1][j1] + tablica[i2][j2];
    tablica[i1][j1] = suma;
    tablica[i2][j2] = suma;

    // wydrukowanie tablicy:
    for(short i = 0; i < N; ++i)
    {
        for(short j = 0; j < N; ++j)
        {
            cout << tablica[i][j] << '\t';
        }
        cout << endl;
    }

    return 0;
}