СРОЧНО!!! C++ !

#include < iostream >
#include < iomanip >
#include < string >

class Matrix
{
double *v;
int n;
public:
Matrix(int N):
n (N),
v (new double[ N*N ])
{
memset(v,0,n*n*sizeof(double));
}
~Matrix(){delete [ ] v;}
double* operator[](int idx){return v+n*idx;}
int size() const {return n;}
void dump(std::ostream & ostr)
{
for(int i = 0; i < n*n; ++i)
{
std::cout << v [ i ] << " ";
if(i%n) std::cout << std::endl;
}
}
bool isSymOfMinorDiag()
{
bool res = true;
for(int i = 0; i < n; ++i)
for(int j = 0; j < n-i; ++j)
if(operator [ ] (i) [ j ] != operator [ ] (n-j-1) [ n-i-1 ])
return false;
return true;
}
};

int main()
{
std::cout << "Enter the size of matrix: " << std::flush;
int n; std::cin >> n;
Matrix m(n);
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j)
{
std::cout
<< "Enter m [ " << i
<< " ] [ " << j << " ] : "
<< std::flush;
std::cin >> m[ i ] [ j ];
}

m.dump(std::cout);
std::cout << (m.isSymOfMinorDiag()? "symmetric":"nonsymmetric")
<< " of minor diagonal" << std::endl;
return 0;
}

В чем сложности конкретно? Точнее задание