PROBLEMA 3

#include<iostream>
using namespace std;
int a[100][100],x,y,i,j,n;
int main()
{
cout<<"n=";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
cout<<"a["<<i<<"]["<<j<<"]=";
cin>>a[i][j];
}
x=a[1][n];
for(i=1;i<=n;i++)
{
if(a[i][n-i+1]>x)
x=a[i][n-1+1];
}
y=a[1][n];
for(i=1;i<=n;i++)
{
if(a[i][n-i+1]<y)
y=a[i][n-1+1];
}
cout<<"Maximul este "<<x;cout<<" iar minimul este "<<y;
return 0;
}
PROBLEMA 4
#include<iostream>
using namespace std;
int a[100][100],i,j,n,m1,m2,ma;
int main()
{
cout<<"n=";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
cout<<"a["<<i<<"]["<<j<<"]=";
cin>>a[i][j];
}
m1=a[1][j];
for(i=2;i<=n;i++)

{
if(a[i][i]>m1)
m1=a[i][i];
}
m2=a[i][n-i+1];
for(i=2;i<=n;i++)
{
if(a[i][n-i+1]>m2)
m2=a[i][n-i+1];
}
ma=(m1+m2)/2;
cout<<"Media aritmetica dintre maximul de pe diagonala principala si cea secundara este
"<<ma;
return 0;
}
PROBLEMA 6
#include<iostream>
using namespace std;
int a[100][100],i,j,n,x;
int main()
{
cout<<"n=";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
cout<<"a["<<i<<"]["<<j<<"]=";
cin>>a[i][j];
}
x=a[1][2];
for (i=1;i<=n/2;++i)
{
for (j=i+1;j<=n-i;++j)
{
if (a[i][j]>x)
x=a[i][j];
}
}
cout<<"Maximul matricei din zona N este "<<x;
return 0;
}