【正文】 。你必須努力，當(dāng)有一天驀然回首時(shí)，你的回憶里才會(huì)多一些色彩斑斕，少一些蒼白無(wú)力。4. 歲月是無(wú)情的，假如你丟給它的是一片空白，它還給你的也是一片空白。既糾結(jié)了自己，又打擾了別人。用一些事情，總會(huì)看清一些人。2. 若不是心寬似海，哪有人生風(fēng)平浪靜。return 0。scanf(%s,str)。void insert(char [])。\039。j++。U39。u39。O39。o39。I39。i39。E39。e39。A39。a39。\039。for (i=0,j=0。return 0。cpy(str,c)。printf(input string:)。}77include int main(){void cpy(char [],char [])。string[i+j]=39。\039。for(j=0。\039。for (i=0。return 0。concatenate(s1,s2,s)。printf(input string2:)。printf(input string1:)。}}76include int main(){void concatenate(char string1[],char string2[],char string[])。str[i]=str[j1]。i(strlen(str)/2)。int i,j。return 0。inverse(str)。printf(input string:)。}}include include int main(){void inverse(char str[])。array[i][j]=array[j][i]。jN。iN。}void convert(int array[][3]){int i,j,t。printf(\n)。jN。iN。printf(convert array:\n)。printf(\n)。jN。iN。printf(\noriginal array :\n)。j++)scanf(%d,amp。i++)for (j=0。for (i=0。int i,j。}74include define N 3int array[N][N]。i++)if (n%i==0)flag=0。amp。for (i=2。return 0。if (prime(n))printf(%d is a prime.\n,n)。scanf(%d,amp。int n。q=sqrt(disc)/(2*a)。}void equal_to_zero(float a,float b){x1=x2=(b)/(2*a)。}void greater_than_zero(float a,float b){x1=(b+sqrt(disc))/(2*a)。printf(x1=%f+%fi\tx2=%f%fi\n,p,q,p,q)。printf(x1=%f\t\tx2=%f\n,x1,x2)。printf(x1=%f\t\tx2=%f\n,x1,x2)。printf(root:\n)。printf(equation: %*x*x+%*x+%=0\n,a,b,c)。b,amp。scanf(%f,%f,%f,amp。float a,b,c。void equal_to_zero(float,float)。}72include include float x1,x2,disc,p,q。}Hcf=v。}while ((r=u%v)!=0){u=v。u=v。}void hcf(int u,int v){int t,r。printf(=%d\n,Lcd)。lcd(u,v)。v)。scanf(%d,%d,amp。void lcd(int,int)。}712include int Hcf,Lcd。}return(v)。}while ((r=u%v)!=0){u=v。u=v。}int hcf(int u,int v){int t,r。printf(=%d\n,l)。printf(=%d\n,h)。v)。scanf(%d,%d,amp。int lcd(int,int,int)。return 0。i++)s1[i]=s2[i]。for (i=0。printf(input s2:)。}615include include int main(){ char s1[80],s2[80]。printf(\nresult:%d.\n,resu)。)resu=0。 s2[i]==39。 amp。if (s1[i]==39。\039。amp。i=0。printf(\ninput string2:)。printf(input string1:)。}614include int main(){ int i,resu。printf(\nThe new string is:%s\n,s1)。s1[i]=39。\039。)i++。while (s1[i]!=39。printf(input string2:)。printf(input string1:)。}613include int main(){ char s1[80],s2[40]。printf(\n)。jn。printf(original text:)。j++。))ch[j]=219ch[j]。 (ch[j]=39。) amp。else if ((ch[j]=39。Z39。amp。A39。\039。j=0。gets(ch)。char ch[80]。return 0。j++)putchar(tran[j])。for (j=0。}n=j。elsetran[j]=ch[j]。z39。amp。a39。))tran[j]=155ch[j]。 (ch[j]=39。) amp。){ if ((ch[j]=39。while (ch[j]!=39。printf(\ncipher code :%s,ch)。printf(input cipher code:)。}612acinclude int main(){ int j,n。}printf(\n)。k5。j++)printf(%c,space)。for (j=1。i++){ printf(\n)。for (i=0。char space=39。}。,39。,39。,39。,39。}611include int main(){ char a[5]={39。printf(other : %d\n,oth)。printf(digit : %d\n,dig)。}}printf(\nupper case: %d\n,upp)。)spa++。else if (text[i][j]==39。939。amp。039。) low++。 text[i][j]=39。 amp。else if (text[i][j]=39。Z39。amp。A39。\039。amp。for (j=0。i++){ printf(please input line %d:\n,i+1)。for (i=0。char text[3][80]。}return 0。n39。N39。c)。printf(continu or not(Y/N)?)。elsetop=mid+1。 sign=1。if (number==a[mid]){loca=mid。amp。 //bott是查找區(qū)間的最末位置if ((numbera[0])||(numbera[N1])) //要查的數(shù)不在查找區(qū)間內(nèi) loca=1。top=0。number)。while(flag){printf(input number to look for:)。i++)printf(%5d,a[i])。for (i=0。elseprintf(enter this data again:\n)。a[i])。i=1。scanf(%d,amp。char c。return 0。 /* 輸出鞍點(diǎn)的值和所在行列號(hào) */ break。 /* 如果max不是同列最小，表示不是鞍點(diǎn)令flag1為0 */ continue。kN。 /* 將最大數(shù)所在的列號(hào)存放在maxj中 */}flag=1。j++) /* 找出第i行中的最大數(shù) */if (a[i][j]max){max=a[i][j]。 /* 將列號(hào)0賦給maxj保存 */for (j=0。i++){max=a[i][0]。for (i=0。j++)scanf(%d,amp。i++) /* 輸入數(shù)組 */for (j=0。for (i=0。}68include define N 4define M 5 /* 數(shù)組為4行5列 */int main(){int i,j,k,a[N][M],max,maxj,flag。printf(\n)。j=n。i=n。a[i][j]=k。else{i=i+2。if (jn) j=1。j=j1。amp。j=j+1。k=n*n。a[1][j]=1。j++)a[i][j]=0。i++)for (j=1。}for (i=1。amp。amp。n)。while(p==1){printf(enter n(n=115):)。}67include int main(){ int a[15][15],i,j,k,p,n。}printf(\n)。j++)printf(%6d,a[i][j])。i++){for (j=0。for (i=0。j=i1。iN。a[i][0]=1。iN。}66include define N 10int main(){ int i,j,a[N][N]。printf(\n)。iN。}printf(\nNow,array a:\n)。a[i]=a[Ni1]。iN/2。i++)printf(%4d,a[i])。for (i=0。a[i])。iN。printf(enter array a:\n)。return 0。i++)printf(%5d,a[i])。for (i=0。}break。a[j]=temp1。j11。a[i]=number。i10。if (numberend)a[10]=number。number)。printf(insert data:)。i++)printf(%5d,a[i])。for (i=0。int temp1,temp2,number,end,i,j。return 0。i++)sum=sum+a[i][i]。for (i=0。j++)scanf(%3d,amp。i++)for (j=0。for (i=0。int i,j。return 0。i++)printf(%5d,a[i])。for (i=1。a[min]=temp。temp=a[i]。j=10。i++){min=i。for (i=1。i++)printf(%5d,a[i])。for (i=1。}printf(\n)。scanf(%d,amp。i=10。printf(enter data:\n)。return 0。n=0。n++。i=100。}printf(\n)。amp。j=100。isqrt(100)。a[1]=0。i=100。}第6章利用數(shù)組處理批量數(shù)據(jù)142習(xí)題16861include include int main(){int i,j,n,a[101]。)printf(A%c\nB