Professional Documents
Culture Documents
#include<cmath>
int main()
int n;
int a[COL][COL];
Input(a,n);
Output(a,n);
if(CheckMaTranTamGiacTren(a,n))
else
if(CheckMaTranTamGiacDuoi(a,n))
else
else
if(CheckMTDoiXungQuaDuongCheoChinh(a,n))
else
cout<<"Ma Tran tren khong doi xung qua duong cheo chinh!"<<endl;
cout<<"Tong cua cac phan tu thuoc tam giac tren la: "<<sum(a,n)<<endl;
int k;
do{
cin>> k;
}while(k>=n||n<0);
int b[COL];
for(int i =0;i<n;i++)
cin>>b[i];
chenDayVaoDongK(a,n,b,k);
cout<<"Ma tran sau khi chen day tren vao dong k= "<<k<<" la: "<<endl;
Output(a,n);
cout<<"Sau khi hoan vi tong cac dong giam tu tren xuong: " <<endl;
sapXepTheoTongDongGiamDan(a,n);
Output(a,n);
DeleteRCMAX(a,n);
cout<<"Ma tran sau khi xoa cot va dong cua phan tu lon nhat la: "<<endl;
Output(a,n);
}
void Input(int a[][COL],int &n)
{
cin>>n;
for(int i =0;i<n;i++)
for(int j=0;j<n;j++)
cin>>a[i][j];
for(int i =0;i<n;i++)
for(int j=0;j<n;j++)
cout<<a[i][j]<<"\t";
cout<<endl;
for(int i =1;i<n;i++)
for(int j=0;j<i;j++)
{
if(a[i][j]!=0)
return false ;
return true;
for(int j =1;j<n;j++)
for(int i=0;i<j;i++)
if(a[i][j]!=0)
return false ;
return true;
if(CheckMaTranTamGiacDuoi(a,n)==true&&CheckMaTranTamGiacTren(a,n)==true)
for(int i =0;i<n;i++)
for(int j=0;j<n;j++)
if(i==j&&(a[i][j]==1))
return true;
}
}
return false;
for(int i =0;i<n;i++)
for(int j=0;j<n;j++)
if(a[i][j]!=a[j][i])
return false;
return true;
}
int sum(int a[][COL],int n)
{
int tong=0;
for(int i =0;i<n;i++)
for(int j=0;j<n;j++)
if(CheckMaTranTamGiacTren(a,n))
tong+=a[i][j];
return tong;
bool IsPrime(int n)
{
if(n<2)
return false;
if(n%i==0)
return false;
return true;
int sum=0;
for(int j=0;j<n;j++)
if(IsPrime(a[k][j]))
sum+=a[k][j];
return sum;
a[i][col] = a[j][col];
a[j][col] = temp;
tong[i] += a[i][j];
hoanViDong(a, i, j);
tong[i] = tong[j];
tong[j] = temp;
}
void DeleteRCMAX(int a[][COL],int &n)
{
int max=a[0][0];
for(int i =0;i<n;i++)
for(int j=0;j<n;j++)
if(max<a[i][j])
max=a[i][j];
vt1=i;
vt2=j;
for(int i =vt1;i<n-1;i++)
for(int j =0;j<n;j++)
a[i][j]=a[i+1][j];
for(int i=0;i<n-1;i++)
for(int j =vt2;j<n-1;j++)
a[i][j]=a[i][j+1];
}
}
n--;