//}
////p122例题
//int_tmain(intargc,_TCHAR*argv[])
//{
//charcity[80];
//charstate[80];
//cin.getline(city,80,',');
//cin.getline(state,80,'\n');
//cout<<"city:
"<"<//}
//////P124.例6.5另解:
将一个字符串逆序输出
//int_tmain(intargc,_TCHAR*argv[])
//{
//charstr[50];
//cout<<"Pleaseinputacharacterstring:
\n";
//cin.getline(str,50,'\n');
//intn=strlen(str);
//for(inti=n-1;i>=0;i--)
//cout<//cout<//}
//////p124.例6.6另解:
将两个字符串连接输出
//int_tmain(intargc,_TCHAR*argv[])
//{
//charstr1[SIZE],str2[SIZE];
//cout<<"Pleaseinputtwocharacterstrings:
\n";
//cin.getline(str1,SIZE,'\n');
//cin.getline(str2,SIZE,'\n');
//cout<//}
////////p128.6.7
//int_tmain(intargc,_TCHAR*argv[])
//{
//staticchardiamond[][6]={{"*"},{"**"},{"**"},{"**"},{"*"}};
//for(inti=0;i<5;i++)
//{
//for(intj=0;j<5;j++)
//cout<//cout<//}
//}
//////p130.6.11找到二维数组的鞍点
//int_tmain(intargc,_TCHAR*argv[])
//{
//intr=3,c=4,a[3][4]={1,2,3,13,5,6,7,8,9,10,11,12};
//boolflag;
//intmax,maxj;
//for(inti=0;i<3;i++)//对每一行进行一次遍历
//{
//max=a[i][0];
//maxj=0;
//for(intj=0;j<4;j++)
//{
//if(a[i][j]>=max)
//{
//max=a[i][j];
//maxj=j;//找出行最大值,并保存列号
//}
//}
//
//
//
//flag=true;
//for(intk=0;k<3;k++)
//{
//if(max>a[k][maxj])//判断行最大值是否是列中的最小值
//{
//flag=false;//如果列中有更小的,就跳出本层循环,继续寻找
//continue;
//}
//}
//if(flag)//如果行中的最大值确实是列中的最小值,则输出,并跳出循环
//{
//cout<
//break;
//}
//}
//if(!
flag)
//cout<<"SaddlePointisnotexist!
";//每一行遍历之后,如果没有满足题意的,就是不存在鞍点
//
//}
///////p140.2输出两个字符串第一个不相等的字符的ASCII偏差值
//int_tmain(intargc,_TCHAR*argv[])
//{
//charch1[40],ch2[40];
//
//intr,j=0;
//cout<<"Pleaseinputtwocharacterstrings:
"<//cin.getline(ch1,40);
//cin.getline(ch2,40);//填空题
//while(ch1[j]!
='\0'&&ch1[j]==ch2[j])//填空题
//{j++;}
//if(ch1[j]=='\0'&&ch2[j]=='\0')
//r=0;//填空题
//else
//r=ch1[j]-ch2[j];
//cout<//}
///////p140.3另解,将两个数组复制到另一个数组,并且按从小到大顺序排列
//int_tmain(intargc,_TCHAR*argv[])
//{
//charch1[50],ch2[50],ch3[120],temp;
//cout<<"Pleaseinputtwocharacterstrings:
"<//cin.getline(ch1,50);
//cin.getline(ch2,50);
//intm=strlen(ch1);
//intn=strlen(ch2);
//
//strcpy(ch3,strcat(ch1,ch2));//连接之后复制到ch3
//
//for(inti=1;i//for(intj=0;j//{
//if(ch3[j]>ch3[j+1])
//{
//temp=ch3[j+1];
//ch3[j+1]=ch3[j];
//ch3[j]=temp;
//}
//}
//for(intk=0;k//cout<//cout<//}
///////p140.3.1推算算运行结果:
-57
//int_tmain(intargc,_TCHAR*argv[])
//{
//intnum[7]={20,3,-8,-19,5,23,-30};
//intsum=0,i;
//for(i=0;i<7;i++)
//if(num[i]<0)
//sum=num[i]+sum;
//cout<//}
///////p140.3.3推算运行结果
//int_tmain(intargc,_TCHAR*argv[])
//{
//charch[30],c='b';
//inti=0;
//cin>>ch;//cin检测到空格就认为结束
////cin.getline(ch,80);
//
//while(ch[i]!
='\0')
//{
//if(ch[i]==c)
//ch[i]-=32;
//elseif(ch[i]==c-32)
//ch[i]+=32;
//i++;
//}
//cout<//}
///////p140.3.4推算运行结果,编译正常,但运行完之后会报错,待查
//int_tmain(intargc,_TCHAR*argv[])
//{
//charstring[25],str[2][25];
//inti;
//for(i=0;i<3;i++)
//cin.getline(str[i],25);
//strcpy(string,str[0]);
//if(strcmp(str[1],string)>0)
//strcpy(string,str[1]);
//if(strcmp(str[2],string)>0)
//strcpy(string,str[2]);
//cout<//}
/////////p142.4.1习题,筛选法求300以内所有素数(1既不是素数也不是合数,素数也即质数,是指大于1的自然数,除了1和它本身之外不能被其他自然数整除)
//int_tmain(intargc,_TCHAR*argv[])
//{
//cout<<"theprimenumberfrom1to300is:
\n"<//for(inti=2;i<=300;i++)
//{
//boolflag=true;
//for(intj=2;j//{
//if(i%j==0)
//flag=false;
//}
//if(flag)
//cout<
//}
//cout<<"\n"<//}
///////p142.4.2将一个新字符插入到已排序号的数组中的合适位置,应该有更简单的方法
//int_tmain(intargc,_TCHAR*argv[])
//{
//charstr1[40],str2[40],str3[100];
//intn;
//cout<<"Pleaseinputasortedstring:
\n";
//cin.getline(str1,80);
//cout<<"Pleaseinputanewcharacter:
\n";
//cin.getline(str2,5);
//strcpy(str3,strcat(str1,str2));
//intm=strlen(str3);
//for(inti=0;i//if((str3[i]<=str3[m-1])&&(str3[i+1]>=str3[m-1]))
//{
//n=i;
//}
//charstr4[110];
//for(intj=0;j<=n;j++)
//str4[j]=str3[j];
//str4[n+1]=str3[m-1];
//for(intk=n+2;k//str4[k]=str3[k-1];
//cout<<"Theresortedstringis:
\n";
//for(inti=0;i//cout<//cout<//}
/////////p142.3将数组中的值重新存放
//int_tmain(intargc,_TCHAR*argv[])
//{
//intarr[100],temp;
//for(inti=0;i//cin>>arr[i];
//intm=SIZE;
//if(m%2==0)
//{
//for(inti=0;i//{
//temp=arr[m-1-i];
//arr[m-1-i]=arr[i];
//arr[i]=temp;
//}
//}
//else
//{
//for(inti=0;i<(m-1)/2;i++)
//{
//temp=arr[m-1-i];
//arr[m-1-i]=arr[i];
//arr[i]=temp;
//}
//
//}
//for(inti=0;i//cout<//}
/////////p142.4打印杨辉三角前10行
//int_tmain(intargc,_TCHAR*argv[])
//{
//intarray[10][20];
//for(inti=0;i<10;i++)
//{
//array[i][0]=1;
//array[i][i]=1;
//}
//for(inti=2;i<10;i++)
//for(intj=1;j
//{
//array[i][j]=array[i-1][j-1]+array[i-1][j];//精髓
//}
//cout<//for(inti=0;i<10;i++)
//{
//cout<//for(intj=0;j
//{
//cout<(2);
//}
//cout<<"\n";
//}
//}
///////p142.5统计中英文大小写字母、数字及其他字符个数
//int_tmain(intargc,_TCHAR*argv[])
//{
//charstr[3][SIZE];
//intcapital_letter=0,small_letter=0,digital=0,blank=0,others=0;
//cout<<"Pleaseinputaartical,3rows,80characters/row:
"<//for(inti=0;i<3;i++)
//cin.getline(str[i],SIZE);
//for(inti=0;i<3;i++)
//{
//for(intj=0;j//{
//if((str[i][j]>=65)&&(str[i][j]<=90))
//capital_letter++;
//if((str[i][j]>=97)&&(str[i][j]<=122))
//small_letter++;
//if((str[i][j]>=48)&&(str[i][j]<=57))
//digital++;
//if(str[i][j]==32)
//blank++;
//}
//}
//cout<//}
///////////p142.6打印图案
//int_tmain(intargc,_TCHAR*argv[])
//{
//cout<//for(inti=1;i<5;i++)
//cout<//}
/////////p142.7求4*4矩阵对角线元素值之和
//int_tmain(intargc,_TCHAR*argv[])
//{
//doubleM[SIZE][SIZE],diagonal1=0,diagonal2=0;
//cout<<"Pleaseinputa4*4matrix:
"<//for(inti=0;i//for(intj=0;j//cin>>M[i][j];
//for(inti=0;i//diagonal1+=M[i][i];
//for(inti=0;i//{
//diagonal2+=M[i][SIZE-1-i];
//}
//cout<<"Thesumoftheleftdiagonalis:
"<//cout<<"Thesumoftherightdiagonalis:
"<//}
/////////p142.8数理统计
//int_tmain(intargc,_TCHAR*argv[])
//{
//intarray[SIZE],max,min,sum;
//doubleaverage;
//cout<<"Pleaseinputaarrayincluding10elementsfrom30to300:
"<//for(inti=0;i//cin>>array[i];
//cout<<"\n";
//cout<<"Thearrayis:
"<<"\n"<//for(inti=0;i//cout<//max=array[0];
//min=array[0];
//sum=array[0];
//for(inti=1;i//{
//sum+=array[i];
//if(array[i]>max)
//max=array[i];
//if(array[i]//min=array[i];
//}
//average=sum/double(SIZE);
//cout<<"\n";
//cout<<"Themaxvalueofthearrayis:
"<//cout<<"Theminvalueofthearrayis:
"<//cout<<"Theaveragevalueofthearrayis:
"<//}
/////////p142.8成绩排序
int_tmain(intargc,_TCHAR*argv[])
{
doublearray[SIZE],temp;
for(inti=0;iarray[i]=rand()%101+0;
cout<<"Thescoreofcomputercourseis:
\n"<for(inti=0;icout<cout<<"\n";
for(inti=1;ifor(intj=0;j{
if(array[j]{
temp=array[j+1];
array[j+1]=array[j];
array[j]=temp;
}
}
cout<<"Thesortedscoreis:
\n"<for(inti=0;icout<cout<<"\n";
}