#include <iostream>
#include <cmath>

using namespace std;

class Matrix
{
private:
    int matr[15][15];
    int Rank;
public:

    int sum;
    Matrix() {
        cout << "\nСonstructor was called for " << this << endl;
    }

    // Конструктор глибокого копіювання, а також тут ж виділяю пам'ять для свого динамічного масиву

    Matrix(const Matrix& source) {

        Rank = source.Rank;

        if (source.matr)
        {
            int** matr = new int* [Rank];
            for (int i = 0; i < Rank; i++)
                matr[i] = new int[Rank];

            for (int i = 0; i < Rank; ++i) {
                for (int j = 0; j < Rank; j++) {
                    matr[i][j] = source.matr[i][j];
                }
            }
        }
        else
            int** matr = nullptr;
    }

    ~Matrix() {
        if (matr != NULL) {
            for (int i = 0; i < Rank; ++i) {
                delete[] matr[i];
            }
            delete[] matr;
        }
        cout << "\nDestructor was called for " << this << endl;
    }

    void setMatrix() {
        cout << "\nInput rang of matrix (max 15):" << endl;
        cin >> Rank;
        if (Rank > 15) {
            while (Rank > 15) {
                cout << "Incorrect rang" << endl;
                cout << "Input rang of matrix (max 15):" << endl;
                cin >> Rank;
            }
        }
        cout << "Input elements of matrix:" << endl;
        for (int i = 0; i < Rank; i++) {
            for (int j = 0; j < Rank; j++) {
                cin >> matr[i][j];
            }
        }
        cout << endl;
    }

    void Data() {
        setMatrix();
        cout << "Elements:" << endl;
        printMatrix();
        cout << "\nSum of diagonal: " << mainDiagonal() << endl;
        cout << "Sum of elements above diagonal:  " << upSum() << endl;
        cout << "Sum of elements under diagonal: " << downSum() << endl;
    }

    void printMatrix() {
        for (int i = 0; i < Rank; i++) {
            for (int j = 0; j < Rank; j++) {
                cout << matr[i][j] << "  ";
            }
            cout << endl;
        }
    }

    int mainDiagonal() {
        sum = 0;
        for (int i = 0, j = 0; i < Rank && j < Rank; i++, j++) {
            sum = sum + matr[i][j];
        }
        return sum;
    }

    int upSum() {
        int upsum = 0;
        for (int i = 0; i < Rank - 1; i++) {
            for (int j = i + 1; j < Rank; j++) {
                upsum = upsum + matr[i][j];
            }
        }
        return upsum;
    }

    int downSum() {
        int downsum = 0;
        for (int i = 1; i < Rank; i++) {
            for (int j = 0; j < i; j++) {
                downsum = downsum + matr[i][j];
            }
        }
        return downsum;
    }

    bool Check(const Matrix& b) {

        if (this->Rank != b.Rank) {
            cout << "\nSum of these matrix is impossible!" << endl;
        }
        else {
            return true;
        }
    }

    bool operator> (const Matrix& a)
    {
        return this->sum > a.sum;

    }

    void operator+(const Matrix& b) {

        Matrix result;
        result.Rank = b.Rank;
        for (int i = 0; i < this->Rank; i++) {
            for (int j = 0; j < this->Rank; j++) {
                result.matr[i][j] = this->matr[i][j] + b.matr[i][j];
            }
        }
        cout << "\n\n Sum of two matrix = " << endl;
        result.printMatrix();
    }

};
int main() {
    system("chcp 1251");

    Matrix Matrix1;
    Matrix1.Data();
    Matrix Matrix2;
    Matrix2.Data();
    Matrix Matrix3;
    Matrix3.Data();
    Matrix Matrix4;
    Matrix4.Data();

    Matrix mass[4];
    mass[0] = Matrix1;
    mass[1] = Matrix2;
    mass[2] = Matrix3;
    mass[3] = Matrix4;

    Matrix temp;
    for (int j = 0; j < 3; j++) {
        if (mass[j] > mass[j + 1]) {
            temp = mass[j + 1];
            int t = j;
            while (mass[t] > temp) {
                mass[t + 1] = mass[t];
                if (t == 0) {
                    t--;
                    break;
                }
                t--;
            }
            mass[t + 1] = temp;
        }
    }

    cout << "\n\nArr of objects of class Matrix(slid):" << endl;
    for (int n = 0; n < 4; n++) {
        cout << mass[n].sum << endl;
    }

    if (mass[0].Check(mass[1])) {
        mass[0] + mass[1];
    }

    return 0;
}

#include <stdio.h> 
#include <stdlib.h> 


// Function to convert decimal to Roman Numerals
int printRoman(int number)
{
    int num[] = { 1,4,5,9,10,40,50,90,100,400,500,900,1000 };
    char sym[] = { 'I','IV','V','IX','X','XL','XC','C','CD','D','CM','M'};
    int i = 13;
    while (number > 0)
    {
        int div = number / num[i];
        number = number % num[i];
        while (div--)
        {
            printf("%s", *(sym + i));
        }
        i--;
    }
    return 0;
}
//Driver program
int main()
{
    int number;
    printf("Enter a number:");
    scanf_s("%d", &number);

    printRoman(number);

    return 0;
}

    
    int min, max;
    printf("\n Виберіть проміжок чисел N які будуть входити в масив( A - B ):\n ");
    scanf_s("%i  %i", &min, &max);

 printf("\n Новий масив:");
    for (i = 0; i < n; i++) {
        if (a[i] % 2 != 0) {
            a[i] = a[i] << 1;
            printf("%d\t", a[i]);
        }