Заменить элементы в двумерном массиве

#include <stdlib.h>
#include <iostream>
#include <ctime>
 
using namespace std;
 
int main()
{ 
int n, i, j, max, min, q, w;
cout <<" n = ";
cin >> n;
int **a = new int*[n];
for(int i = 0; i < n; i++)
a[i] = new int[n];
for(int i = 0; i < n; i++, cout << endl)
for(int j = 0; j < n; j++)
{
cout <<" a["<< i <<"]["<< j <<"]= ";
cin>>a[i][j];
}
cout<<" Array: "<< endl;
for(int i = 0; i < n; i++, cout << endl)
for(int j = 0; j < n; j++)
cout<<a[i][j]<<" ";
for(int i = 0; i < n; i++)
//search min
 
min = a[1][1];
for (i = 1; i < n; i++)
{
for (j = 0; j < i; j++)
{
if (a[i][j] < min && min % 2 == 1) min = a[i][j];
}
}
//search max
max = a[1][1];
for (i = 0; i < n; i++)
{
for (j = i; j < n; j++)
{
if (a[i][j] > max && max % 2 == 0) max = a[i][j];
}
}
cout << "MIN: " << min << endl << "MAX: " << max << endl;
//zamena
int j1, i1;
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
if (a[i][j] == min)
{
a[i][j] = max;
j1 = j;
i1 = i;
}
}
}
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
if (a[i][j] == max && i != i1 && j != j1) a[i][j] = min;
}
}
//vivod
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
cout << a[i][j] << " ";
}
cout << endl;
}
cout << endl;
system("pause");
return 0;
}

 // some code

#include <iostream>
#include <climits>
using namespace std;
 
int main()
{ 
    int n, max_odd=INT_MIN, min_even=INT_MAX, iodd=0, jodd=0, ieven=0, jeven=0;
    cout << "n="; cin >> n;
    
       int **a = new int*[n];    
    for(int i = 0; i < n; i++)
        a[i] = new int[n];
        
    cout << "Enter matrix " << n << "x" << n << ":\n";    
    for(int i = 0; i < n; i++)
    for(int j = 0; j < n; j++) 
    {
        cin >> a[i][j];        
        if (i<=j && a[i][j]%2 && (max_odd==INT_MIN || a[i][j]>max_odd)) 
        {max_odd=a[i][j];iodd=i;jodd=j;}        
        if (i>j && a[i][j]%2==0 && a[i][j] && (min_even==INT_MAX || a[i][j]<min_even))
        {min_even=a[i][j];ieven=i;jeven=j;}
    }
    
    if (max_odd==INT_MIN) cout << "Odd elements are absent higher and on the main diagonal\n";
    if (min_even==INT_MAX) cout << "Even elements (without zero) are absent under the main diagonal\n";
    if (max_odd!=INT_MIN && min_even!=INT_MAX) 
    {
        swap (a[iodd][jodd],a[ieven][jeven]);    
        cout << "Modified matrix:\n";
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < n; j++)        
            cout << a[i][j] << " ";        
        cout << "\n";
        }
    }  
    
    for (int i = 0; i < n; i++)
    delete[]a[i];
    delete[]a;
system("pause");
return 0;
}