




版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
1、1-5#includeintmain()printf(nn);printf(VeryGood!nn);printf(n);return0;1-6#includeintmain()inta,b,c,max;printf(pleaseinputa,b,c:n);scanf(%d,%d,%d,&a,&b,&c);max=a;if(maxb)max=b;if(maxc)max=c;printf(Thelargestnumberis%dn,max);return0;4-4-1#includeintmain()inta,b,c;printf(请输入三个整数:);scanf(%d,%d,%d,&a,&b,&
2、c);if(ab)if(bc)printf(max=%dn,c);elseprintf(max=%dn,b);elseif(ac)printf(max=%dn,c);elseprintf(max=%dn,a);return0;4-6.#includeintmain()intx,y;printf(输入x:);scanf(%d,&x);if(x1)/*x1*/y=x;printf(x=%3d,y=x=%dn,x,y);elseif(x10)/*1=x=10*/y=3*x-11;printf(x=%d,y=3*x-11=%dn,x,y);return0;4-7-1#includeintmain()i
3、ntx,y;printf(enterx:);scanf(%d,&x);y=-1;if(x!=0)if(x0)y=1;elsey=0;printf(x=%d,y=%dn,x,y);return0;4-7-2#includeintmain()intx,y;printf(pleaseenterx:);scanf(%d,&x);y=0;if(x=0)if(x0)y=1;elsey=-1;printf(x=%d,y=%dn,x,y);return0;4-8#includeintmain()floatscore;chargrade;printf(请输入学生成绩:);scanf(%f,&score);whi
4、le(score100|score0)printf(n输入有误,请重输);scanf(%f,&score);switch(int)(score/10)case10:case9:grade=A;break;case8:grade=B;break;case7:grade=C;break;case6:grade=D;break;case5:case4:case3:case2:case1:case0:grade=E;printf(成绩是%5.1f,相应的等级是%cn,score,grade);return0;4-11#includeintmain()intt,a,b,c,d;printf(请输入四个数
5、:);scanf(%d,%d,%d,%d,&a,&b,&c,&d);printf(a=%d,b=%d,c=%d,d=%dn,a,b,c,d);if(ab)t=a;a=b;b=t;if(ac)t=a;a=c;c=t;if(ad)t=a;a=d;d=t;if(bc)t=b;b=c;c=t;if(bd)t=b;b=d;d=t;if(cd)t=c;c=d;d=t;printf(排序结果以下:n);printf(%d%d%d%dn,a,b,c,d);return0;4-12#includeintmain()inth=10;floatx1=2,y1=2,x2=-2,y2=2,x3=-2,y3=-2,x4=
6、2,y4=-2,x,y,d1,d2,d3,d4;printf(请输入一个点(x,y):);scanf(%f,%f,&x,&y);d1=(x-x4)*(x-x4)+(y-y4)*(y-y4);/*求该点到各中心点距离*/d2=(x-x1)*(x-x1)+(y-y1)*(y-y1);d3=(x-x2)*(x-x2)+(y-y2)*(y-y2);d4=(x-x3)*(x-x3)+(y-y3)*(y-y3);if(d11&d21&d31&d41)h=0;/*判断该点可否在塔外*/printf(该点高度为%dn,h);return0;5-3#includeintmain()intp,r,n,m,temp
7、;printf(请输入两个正整数scanf(%d,%d,&n,&m);if(nm)n,m:);temp=n;n=m;m=temp;p=n*m;while(m!=0)r=n%m;n=m;m=r;printf(它们的最大合约数为:%dn,n);printf(它们的最小合约数为:%dn,p/n);return0;5-4#includeintmain()charc;intletters=0,space=0,digit=0,other=0;printf(请输入一行字符:n);while(c=getchar()!=n)if(c=a&c=A&c=0&c=9)digit+;elseother+;printf(
8、字母数:%dn空格数:%dn数字数:%dn其余字符数:%dn,letters,space,digit,other);return0;5-5#includeintmain()inta,n,i=1,sn=0,tn=0;printf(a,n=:);scanf(%d,%d,&a,&n);while(i=n)tn=tn+a;/*赋值后的tn为i个a组成数的值*/sn=sn+tn;/*赋值后的sn为多项式前i项之和*/a=a*10;+i;printf(a+aa+aaa+.=%dn,sn);return0;5-6#includeintmain()doubles=0,t=1;intn;for(n=1;n=20
9、;n+)t=t*n;s=s+t;printf(1!+2!+.+20!=%22.15en,s);return0;5-7#includeintmain()intn1=100,n2=50,n3=10;doublek,s1=0,s2=0,s3=0;for(k=1;k=n1;k+)/*计算s1=s1+k;for(k=1;k=n2;k+)/*计算s2=s2+k*k;for(k=1;k=n3;k+)/*计算s3=s3+1/k;1到1到1到100的和*/50各数的平方和10的各倒数和*/*/printf(sum=%15.6fn,s1+s2+s3);return0;5-8#includeintmain()int
10、i,j,k,n;printf(parcissusnumbersare);for(n=100;n1000;n+)i=n/100;j=n/10-i*10;k=n%10;if(n=i*i*i+j*j*j+k*k*k)printf(%d,n);printf(n);return0;5-10#includeintmain()inti,n=20;doublea=2,b=1,s=0,t;for(i=1;i=n;i+)s=s+a/b;t=a,a=a+b,b=t;printf(sum=%16.10fn,s);return0;5-11#includeintmain()doublesn=100,hn=sn/2;int
11、n;for(n=2;n=10;n+)sn=sn+2*hn;hn=hn/2;/*第n次落地时共经过的米数/*第n次反跳高度*/*/printf(第10次落地时共经过%f米n,sn);printf(第10次反弹%f米n,hn);return0;5-12#includeintmain()intday,x1,x2;day=9;x2=1;while(day0)x1=(x2+1)*2;/*第1天的桃子数是第2天桃子数加1后的2倍.*/x2=x1;day-;printf(total=%dn,x1);return0;5-13#include#includeintmain()floata,x0,x1;print
12、f(enterapositivenumber:);scanf(%f,&a);x0=a/2;x1=(x0+a/x0)/2;dox0=x1;x1=(x0+a/x0)/2;while(fabs(x0-x1)=1e-5);printf(Thesquarerootof%5.2fis%8.5fn,a,x1);return0;5-15#include#includeintmain()floatx0,x1,x2,fx0,fx1,fx2;doprintf(enterx1&x2:);scanf(%f,%f,&x1,&x2);fx1=x1*(2*x1-4)*x1+3)-6;fx2=x2*(2*x2-4)*x2+3)
13、-6;while(fx1*fx20);dox0=(x1+x2)/2;fx0=x0*(2*x0-4)*x0+3)-6;if(fx0*fx1)=1e-5);printf(x=%6.2fn,x0);return0;5-16#includeintmain()inti,j,k;for(i=0;i=3;i+)for(j=0;j=2-i;j+)printf();for(k=0;k=2*i;k+)printf(*);printf(n);for(i=0;i=2;i+)for(j=0;j=i;j+)printf();for(k=0;k=4-2*i;k+)printf(*);printf(n);return0;6-
14、1#include#includeintmain()inti,j,n,a101;for(i=1;i=100;i+)ai=i;a1=0;for(i=2;isqrt(100);i+)for(j=i+1;j=100;j+)if(ai!=0&aj!=0)if(aj%ai=0)aj=0;printf(n);for(i=2,n=0;i=100;i+)if(ai!=0)printf(%5d,ai);n+;if(n=10)printf(n);n=0;printf(n);return0;6-2#includeintmain()inti,j,min,temp,a11;printf(enterdata:n);for
15、(i=1;i=10;i+)printf(a%d=,i);scanf(%d,&ai);printf(n);printf(Theorginalnumbers:n);for(i=1;i=10;i+)printf(%5d,ai);printf(n);for(i=1;i=9;i+)min=i;for(j=i+1;jaj)min=j;temp=ai;ai=amin;amin=temp;printf(nThesortednumbers:n);for(i=1;i=10;i+)printf(%5d,ai);printf(n);return0;6-3#includeintmain()inta33,sum=0;in
16、ti,j;printf(enterdata:n);for(i=0;i3;i+)for(j=0;j3;j+)scanf(%3d,&aij);for(i=0;i3;i+)sum=sum+aii;printf(sum=%6dn,sum);return0;6-4#includeintmain()inta11=1,4,6,9,13,16,19,28,40,100;inttemp1,temp2,number,end,i,j;printf(arraya:n);for(i=0;iend)a10=number;elsefor(i=0;inumber)temp1=ai;ai=number;for(j=i+1;j1
17、1;j+)temp2=aj;aj=temp1;temp1=temp2;break;printf(Nowarraya:n);for(i=0;i11;i+)printf(%5d,ai);printf(n);return0;6-5#include#defineN5intmain()intaN,i,temp;printf(enterarraya:n);for(i=0;iN;i+)scanf(%d,&ai);printf(arraya:n);for(i=0;iN;i+)printf(%4d,ai);for(i=0;iN/2;i+)/循环的作用是将对称的元素的值互换temp=ai;ai=aN-i-1;aN
18、-i-1=temp;printf(nNow,arraya:n);for(i=0;iN;i+)printf(%4d,ai);printf(n);return0;6-6#include#defineN10intmain()inti,j,aNN;for(i=0;iN;i+)aii=1;ai0=1;for(i=2;iN;i+)for(j=1;j=i-1;j+)aij=ai-1j-1+ai-1j;for(i=0;iN;i+)for(j=0;j=i;j+)printf(%6d,aij);printf(n);printf(n);return0;6-7#includeintmain()inta1515,i,j
19、,k,p,n;p=1;while(p=1)printf(entern(n=1-15):);scanf(%d,&n);if(n!=0)&(n=15)&(n%2!=0)p=0;for(i=1;i=n;i+)for(j=1;j=n;j+)aij=0;j=n/2+1;a1j=1;for(k=2;k=n*n;k+)i=i-1;j=j+1;if(in)i=i+2;j=j-1;elseif(in)j=1;if(aij=0)aij=k;elsei=i+2;j=j-1;aij=k;for(i=1;i=n;i+)for(j=1;j=n;j+)printf(%5d,aij);printf(n);return0;6-
20、8#include#defineN4#defineM5/*数组为4行5列*/intmain()inti,j,k,aNM,max,maxj,flag;printf(pleaseinputmatrix:n);for(i=0;iN;i+)/*输入数组*/for(j=0;jM;j+)scanf(%d,&aij);for(i=0;iN;i+)max=ai0;maxj=0;for(j=0;jmax)max=aij;maxj=j;/*将本行的最大数存放在max/*将最大数所在的列号存放在中*/maxj中*/flag=1;/*先假设是鞍点,以flag为1代表*/for(k=0;kakmaxj)flag=0;/
21、*将最大数和其同列元素对照*/*若是max不是同列最小,表示不是鞍点令flag1为0*/continue;if(flag)/*若是flag1为1表示是鞍点*/printf(a%d%d=%dn,i,maxj,max);/*输出鞍点的值和所内行列号*/break;if(!flag)/*若是flag为0表示鞍点不存在*/printf(Itisnotexist!n);return0;6-9#include#defineN15intmain()inti,number,top,bott,mid,loca,aN,flag=1,sign;charc;printf(enterdata:n);scanf(%d,&
22、a0);i=1;while(i=ai-1)i+;elseprintf(enterthisdataagain:n);printf(n);for(i=0;iN;i+)printf(%5d,ai);printf(n);while(flag)printf(inputnumbertolookfor:);scanf(%d,&number);sign=0;top=0;/top是查找区间的初步地址bott=N-1;/bott是查找区间的最末地址if(numberaN-1)/要查的数不在查找区间内loca=-1;/表示找不到while(!sign)&(top=bott)mid=(bott+top)/2;if(n
23、umber=amid)loca=mid;printf(Hasfound%d,itspositionis%dn,number,loca+1);sign=1;elseif(numberamid)bott=mid-1;elsetop=mid+1;if(!sign|loca=-1)printf(cannotfind%d.n,number);printf(continuornot(Y/N)?);scanf(%c,&c);if(c=N|c=n)flag=0;return0;6-10#includeintmain()inti,j,upp,low,dig,spa,oth;chartext380;upp=low
24、=dig=spa=oth=0;for(i=0;i3;i+)printf(pleaseinputline%d:n,i+1);gets(texti);for(j=0;j=A&textij=a&textij=0&textij=9)dig+;elseif(textij=)spa+;elseoth+;printf(nuppercase:%dn,upp);printf(lowercase:%dn,low);printf(digit:%dn,dig);printf(space:%dn,spa);printf(other:%dn,oth);return0;6-12a-c#includeintmain()int
25、j,n;charch80,tran80;printf(inputciphercode:);gets(ch);printf(nciphercode:%s,ch);j=0;while(chj!=0)if(chj=A)&(chj=a)&(chj=z)tranj=219-chj;elsetranj=chj;j+;n=j;printf(noriginaltext:);for(j=0;jn;j+)putchar(tranj);printf(n);return0;6-12b#includeintmain()intj,n;charch80;printf(inputciphercode:n);gets(ch);
26、printf(nciphercode:%sn,ch);j=0;while(chj!=0)if(chj=A)&(chj=a)&(chj=z)chj=219-chj;elsechj=chj;j+;n=j;printf(originaltext:);for(j=0;jn;j+)putchar(chj);printf(n);return0;6-13#includeintmain()chars180,s240;inti=0,j=0;printf(inputstring1:);scanf(%s,s1);printf(inputstring2:);scanf(%s,s2);while(s1i!=0)i+;w
27、hile(s2j!=0)s1i+=s2j+;s1i=0;printf(nThenewstringis:%sn,s1);return0;7-1-1#includeintmain()inthcf(int,int);intlcd(int,int,int);intu,v,h,l;scanf(%d,%d,&u,&v);h=hcf(u,v);printf(H.C.F=%dn,h);l=lcd(u,v,h);printf(L.C.D=%dn,l);return0;inthcf(intu,intv)intt,r;if(vu)t=u;u=v;v=t;while(r=u%v)!=0)u=v;v=r;return(
28、v);intlcd(intu,intv,inth)return(u*v/h);7-3#includeintmain()intprime(int);intn;printf(inputaninteger:);scanf(%d,&n);if(prime(n)printf(%disaprime.n,n);elseprintf(%disnotaprime.n,n);return0;intprime(intn)intflag=1,i;for(i=2;in/2&flag=1;i+)if(n%i=0)flag=0;return(flag);7-4#include#defineN3intarrayNN;intm
29、ain()voidconvert(intarray3);inti,j;printf(inputarray:n);for(i=0;iN;i+)for(j=0;jN;j+)scanf(%d,&arrayij);printf(noriginalarray:n);for(i=0;iN;i+)for(j=0;jN;j+)printf(%5d,arrayij);printf(n);convert(array);printf(convertarray:n);for(i=0;iN;i+)for(j=0;jN;j+)printf(%5d,arrayij);printf(n);return0;voidconver
30、t(intarray3)inti,j,t;for(i=0;iN;i+)for(j=i+1;jN;j+)t=arrayij;arrayij=arrayji;arrayji=t;#include#includeintmain()voidinverse(charstr);charstr100;printf(inputstring:);scanf(%s,str);inverse(str);printf(inversestring:%sn,str);return0;voidinverse(charstr)chart;inti,j;for(i=0,j=strlen(str);i(strlen(str)/2
31、);i+,j-)t=stri;stri=strj-1;strj-1=t;7-6#includeintmain()voidconcatenate(charstring1,charstring2,charstring);chars1100,s2100,s100;printf(inputstring1:);scanf(%s,s1);printf(inputstring2:);scanf(%s,s2);concatenate(s1,s2,s);printf(nThenewstringis%sn,s);return0;voidconcatenate(charstring1,charstring2,cha
32、rstring)inti,j;for(i=0;string1i!=0;i+)stringi=string1i;for(j=0;string2j!=0;j+)stringi+j=string2j;stringi+j=0;7-7#includeintmain()voidcpy(char,char);charstr80,c80;printf(inputstring:);gets(str);cpy(str,c);printf(Thevowellettersare:%sn,c);return0;voidcpy(chars,charc)inti,j;for(i=0,j=0;si!=0;i+)if(si=a
33、|si=A|si=e|si=E|si=i|si=I|si=o|si=O|si=u|si=U)cj=si;j+;cj=0;7-8#include#includeintmain()charstr80;voidinsert(char);printf(inputfourdigits:);scanf(%s,str);insert(str);return0;voidinsert(charstr)inti;for(i=strlen(str);i0;i-)str2*i=stri;str2*i-1=;printf(output:n%sn,str);7-9#includeintletter,digit,space
34、,others;intmain()voidcount(char);chartext80;printf(inputstring:n);gets(text);printf(string:);puts(text);letter=0;digit=0;space=0;others=0;count(text);printf(nletter:%dndigit:%dnspace:%dnothers:%dn,letter,digit,space,others);return0;voidcount(charstr)inti;for(i=0;stri!=0;i+)if(stri=a&stri=A&stri=0&st
35、ri=9)digit+;elseif(stri=32)space+;elseothers+;7-10#include#includeintmain()intalphabetic(char);intlongest(char);inti;charline100;printf(inputoneline:n);gets(line);printf(Thelongestwordis:);for(i=longest(line);alphabetic(linei);i+)printf(%c,linei);printf(n);return0;intalphabetic(charc)if(c=a&c=A&c=z)
36、return(1);elsereturn(0);intlongest(charstring)intlen=0,i,length=0,flag=1,place=0,point;for(i=0;i=length)length=len;place=point;len=0;return(place);7-11#include#include#defineN10charstrN;intmain()voidsort(char);inti,flag;for(flag=1;flag=1;)printf(inputstring:n);scanf(%s,&str);if(strlen(str)N)printf(s
37、tringtoolong,inputagain!);elseflag=0;sort(str);printf(stringsorted:n);for(i=0;iN;i+)printf(%c,stri);printf(n);return0;voidsort(charstr)inti,j;chart;for(j=1;jN;j+)for(i=0;(istri+1)t=stri;stri=stri+1;stri+1=t;7-*14#include#defineN10#defineM5floatscoreNM;floata_stuN,a_courM;intr,c;intmain()inti,j;float
38、h;floats_var(void);floathighest();voidinput_stu(void);voidaver_stu(void);voidaver_cour(void);input_stu();aver_stu();aver_cour();printf(nNO.cour1cour2cour3cour4cour5avern);for(i=0;iN;i+)printf(nNO%2d,i+1);for(j=0;jM;j+)printf(%8.2f,scoreij);printf(%8.2fn,a_stui);printf(naverage:);for(j=0;jM;j+)printf
39、(%8.2f,a_courj);printf(n);h=highest();printf(highest:%7.2fNO.%2dcourse%2dn,h,r,c);printf(variance%8.2fn,s_var();return0;voidinput_stu(void)inti,j;for(i=0;iN;i+)printf(ninputscoreofstudent%2d:n,i+1);for(j=0;jM;j+)scanf(%f,&scoreij);voidaver_stu(void)inti,j;floats;for(i=0;iN;i+)for(j=0,s=0;jM;j+)s+=sc
40、oreij;a_stui=s/5.0;voidaver_cour(void)inti,j;floats;for(j=0;jM;j+)s=0;for(i=0;iN;i+)s+=scoreij;a_courj=s/(float)N;floathighest()floathigh;inti,j;high=score00;for(i=0;iN;i+)for(j=0;jhigh)high=scoreij;r=i+1;c=j+1;return(high);floats_var(void)inti;floatsumx,sumxn;sumx=0.0;sumxn=0.0;for(i=0;iN;i+)sumx+=
41、a_stui*a_stui;sumxn+=a_stui;return(sumx/N-(sumxn/N)*(sumxn/N);7-15#include#include#defineN10intmain()voidinput(int,charname8);voidsort(int,charname8);voidsearch(int,int,charname8);intnumN,number,flag=1,c;charnameN8;input(num,name);sort(num,name);while(flag=1)printf(ninputnumbertolookfor:);scanf(%d,&
42、number);search(number,num,name);printf(continueotnot(Y/N)?);getchar();c=getchar();if(c=N|c=n)flag=0;return0;voidinput(intnum,charnameN8)inti;for(i=0;iN;i+)printf(inputNO.:);scanf(%d,&numi);printf(inputname:);getchar();gets(namei);voidsort(intnum,charnameN8)inti,j,min,templ;chartemp28;for(i=0;iN-1;i+
43、)min=i;for(j=i;jnumj)templ=numi;strcpy(temp2,namei);numi=nummin;strcpy(namei,namemin);nummin=templ;min=j;strcpy(namemin,temp2);printf(nresult:n);for(i=0;iN;i+)printf(n%5d%10s,numi,namei);voidsearch(intn,intnum,charnameN8)inttop,bott,mid,loca,sign;top=0;bott=N-1;loca=0;sign=1;if(nnumN-1)loca=-1;while
44、(sign=1)&(top=bott)mid=(bott+top)/2;if(n=nummid)loca=mid;printf(NO.%d,hisnameis%s.n,n,nameloca);sign=-1;elseif(nnummid)bott=mid-1;elsetop=mid+1;if(sign=1|loca=-1)printf(%dnotbeenfound.n,n);8-1#includeintmain()voidswap(int*p1,int*p2);intn1,n2,n3;int*p1,*p2,*p3;printf(inputthreeintegern1,n2,n3:);scanf
45、(%d,%d,%d,&n1,&n2,&n3);p1=&n1;p2=&n2;p3=&n3;if(n1n2)swap(p1,p2);if(n1n3)swap(p1,p3);if(n2n3)swap(p2,p3);printf(Now,theorderis:%d,%d,%dn,n1,n2,n3);return0;voidswap(int*p1,int*p2)intp;p=*p1;*p1=*p2;*p2=p;8-2#include#includeintmain()voidswap(char*,char*);charstr120,str220,str320;printf(inputthreeline:n
46、);gets(str1);gets(str2);gets(str3);if(strcmp(str1,str2)0)swap(str1,str2);if(strcmp(str1,str3)0)swap(str1,str3);if(strcmp(str2,str3)0)swap(str2,str3);printf(Now,theorderis:n);printf(%sn%sn%sn,str1,str2,str3);return0;voidswap(char*p1,char*p2)charp20;strcpy(p,p1);strcpy(p1,p2);strcpy(p2,p);8-3#includei
47、ntmain()voidinput(int*);voidmax_min_value(int*);voidoutput(int*);intnumber10;input(number);max_min_value(number);output(number);return0;voidinput(int*number)inti;printf(input10numbers:);for(i=0;i10;i+)scanf(%d,&numberi);voidmax_min_value(int*number)int*max,*min,*p,temp;max=min=number;for(p=number+1;
48、p*max)max=p;elseif(*p*min)min=p;temp=number0;number0=*min;*min=temp;if(max=number)max=min;temp=number9;number9=*max;*max=temp;voidoutput(int*number)int*p;printf(Now,theyare:);for(p=number;pnumber+10;p+)printf(%d,*p);printf(n);8-4#includeintmain()voidmove(int20,int,int);intnumber20,n,m,i;printf(howma
49、nynumbers?);scanf(%d,&n);printf(input%dnumbers:n,n);for(i=0;in;i+)scanf(%d,&numberi);printf(howmanyplaceyouwantmove?);scanf(%d,&m);move(number,n,m);printf(Now,theyare:n);for(i=0;iarray;p-)*p=*(p-1);*array=array_end;m-;if(m0)move(array,n,m);8-5#includeintmain()inti,k,m,n,num50,*p;printf(ninputnumbero
50、fperson:n=);scanf(%d,&n);p=num;for(i=0;in;i+)*(p+i)=i+1;i=0;k=0;m=0;while(mn-1)if(*(p+i)!=0)k+;if(k=3)*(p+i)=0;k=0;m+;i+;if(i=n)i=0;while(*p=0)p+;printf(ThelastoneisNO.%dn,*p);return0;8-6#includeintmain()intlength(char*p);intlen;charstr20;printf(inputstring:);scanf(%s,str);len=length(str);printf(The
51、lengthofstringis%d.n,len);return0;intlength(char*p)intn;n=0;while(*p!=0)n+;p+;return(n);8-7#include#includeintmain()voidcopystr(char*,char*,int);intm;charstr120,str220;printf(inputstring:);gets(str1);printf(whichcharacterthatbegintocopy?);scanf(%d,&m);if(strlen(str1)m)printf(inputerror!);elsecopystr
52、(str1,str2,m);printf(result:%sn,str2);return0;voidcopystr(char*p1,char*p2,intm)intn;n=0;while(nm-1)n+;p1+;while(*p1!=0)*p2=*p1;p1+;p2+;*p2=0;8-8#includeintmain()intupper=0,lower=0,digit=0,space=0,other=0,i=0;char*p,s20;printf(inputstring:);while(si=getchar()!=n)i+;p=&s0;while(*p!=n)if(A=*p)&(*p=Z)+u
53、pper;elseif(a=*p)&(*p=z)+lower;elseif(*p=)+space;elseif(*p=0)+digit;else+other;p+;printf(uppercase:%dprintf(space:%dreturn0;8-9lowercase:%d,upper,lower);digit:%dother:%dn,space,digit,other);#includeintmain()voidmove(int*pointer);inta33,*p,i;printf(inputmatrix:n);for(i=0;i3;i+)scanf(%d%d%d,&ai0,&ai1,
54、&ai2);p=&a00;move(p);printf(Now,matrix:n);for(i=0;i3;i+)printf(%d%d%dn,ai0,ai1,ai2);return0;voidmove(int*pointer)inti,j,t;for(i=0;i3;i+)for(j=i;j3;j+)t=*(pointer+3*i+j);*(pointer+3*i+j)=*(pointer+3*j+i);*(pointer+3*j+i)=t;8-10-2#includeintmain()voidchange(int*p);inta55,*p,i,j;printf(inputmatrix:n);f
55、or(i=0;i5;i+)for(j=0;j5;j+)scanf(%d,&aij);p=&a00;change(p);printf(Now,matrix:n);for(i=0;i5;i+)for(j=0;j5;j+)printf(%d,aij);printf(n);return0;voidchange(int*p)/互换函数inti,j,temp;int*pmax,*pmin;pmax=p;pmin=p;for(i=0;i5;i+)/找最大值和最小值的地址,并赋给pmax,pminfor(j=i;j5;j+)if(*pmax*(p+5*i+j)pmin=p+5*i+j;temp=*(p+12);/将最大值与中心元
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
评论
0/150
提交评论