#include <iostream>
#include <vector>
#include<random>
#include<algorithm>
#include<math.h>
using namespace std;

class MyClass
{
public:
	int collumn, row;
	MyClass(int n = 5, int  m = 5)
	{
		 row = n;
		 collumn = m;
		 for (int i = 0; i < n; i++)
		 {
			 vector<int> matrix2;
			for (int j=0;j<m;j++)
			{
				int randss = rand() % 10;
				matrix2.push_back(randss);
				cout << randss << "\t";
			}
			matrix.push_back(matrix2);
			cout << "\n";
		 }

	}
	void even()
	{
		int count = 0;
		for (int i=0;i<this->row;i++)
		{
			for (int j = 0; j < this->collumn; j++)
			{
				if (!(this->matrix[i][j] % 2))
					count++;
			}
		}
		cout  << "\ncount= " << count << "\n";
	}

	void diap(int A,int B)
	{
		int dob = 1;
		int rowA = A / this->row;
		int collA = A % this->collumn;
		while (A != B+1)
		{
			A++;
			dob *= this->matrix[rowA][collA++];
			if (collA > 4)
			{
				collA = 0;
				rowA++;
			}
		}
		cout << "\ndob = " << dob << endl;
	}
	void ABSsort()
	{
		cout << "ABSsort :: \n";
		for (int i = 0; i < this->row; i++)
		{
			sort(this->matrix[i].begin(), this->matrix[i].end(), [](int a, int b)
			{
				return abs(a) > abs(b);
			});
		}
		cout << endl;
		for (int i = 0; i < row; i++)
		{
			for (int j = 0; j < collumn; j++)
			{
				cout << matrix[i][j]<<"\t";
			}
			cout << "\n";
		}
	}
	vector<vector<int>> matrix;
};

int main()
{
	MyClass* VEK = new  MyClass();
	VEK->even();
	VEK->diap(0, 3);
	VEK->ABSsort();
}