项目一——数组操作
#include <iostream>
using namespace std;
int main()
{
int i,j,t,a[10]= {5,6,9,7,4,8,3,1,2,0};
int x,y;
int z,locate,value;
for(i=0; i<9; i++)
for(j=0; j<9-i; j++)
{
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
for(i=0; i<10; i++)
cout<<a[i]<<" ";
cout<<endl;
cout<<"请输入要删除的数:";
cin>>y;
for(x=y; x<9; x++)
a[x]=a[x+1];
for(x=0; x<9; x++)
cout<<a[x]<<" ";
cout<<endl;
cout<<"插入数的位置为:";
cin>>locate;
cout<<"插入的数为:";
cin>>value;
for(z=9; z>locate; z--)
a[z]=a[z-1];
a[z]=value;
for(z=0; z<10; z++)
cout<<a[z]<<" ";
return 0;
}
项目三——矩阵求和
#include <iostream>
using namespace std;
int main()
{
int i,sum1,sum2,a[3][3]= {8,9,3,6,4,6,7,3,9};
for(i=0; i<3; i++)
sum1=sum1+a[i][i];
for(i=0; i<3; i++)
sum2=sum2+a[i][2-i];
cout<<"一条对角线的和为:"<<sum1<<"\n";
cout<<"另一条对角线的和为:"<<sum2<<endl;
return 0;
}