一、矩阵求和
#include<iostream>
using namespace std;
int main()
{
int a[3][3]={{1,2,3},{4,5,6},{7,8,9}},i,j,x=0;
cout<<"该三阶方阵为:"<<endl;
for(i=0;i<3;i++)
for(j=0;j<3;j++)
{
cout<<a[i][j]<<" ";
if(j==2)
cout<<endl;
}
for(i=0;i<3;i++)
for(j=0;j<3;j++)
if((i+j)%2==0)
x=a[i][j]+x;
cout<<"两对角线上的所有元素之和等于:"<<x<<endl;
return 0;
}
二、数组操作
#include<iostream>
using namespace std;
int main()
{
const int N=10;
int a[N]={3,6,7,0,8,4,1,9,2,5},i,j,k,x,y,z;
for(i=0;i<N-1;i++)
for(j=0;j<N-1-i;j++)
if(a[j]>a[j+1])
{
k=a[j];a[j]=a[j+1];a[j+1]=k;
}
cout<<"数组排序后为:";
for(j=0;j<N;j++)
cout<<a[j]<<" ";
cout<<endl;
cout<<"要删除的数:";
{
cin>>x;
for(j=0;j<N;j++)
{
if(x==a[j])
for(j=x;j<N;j++)
a[j]=a[j+1];
}
for(j=0;j<N-1;j++)
cout<<a[j]<<" ";
cout<<endl;
}
cout<<"要插入的数:";
{
cin>>y;
for(j=0;j<N;j++)
if(a[j]>y) break;
{
for(z=N-1;z>j;z--)
a[z]=a[z-1];
a[z]=y;
}
for(j=0;j<N;j++)
cout<<a[j]<<" ";
cout<<endl;
}
return 0;
}