1、1求最大公約數(shù)與最小公倍數(shù)（15分）#includeintfun1(intm,intn)/輾轉相除法求m/n得公約數(shù)intr;while(n)r=m%n；m=n;n=r；returnm;intfun2(intm,intn)/最小公倍數(shù)returnm*n/fun1(m,n);intmain()inta,b;scanf(%d,%d,&a,&b);/輸入printf(最大公約數(shù)：dn最小公倍數(shù)：%dn,fun1(a,b),fun2(a,b)return0;2排序并插入(15分)#inc1udevoidInsertionSort(int*arr,intn)/插入排序int*last=0,*next=0

2、,key=0,i=0;for(i=1;in;+i)next=arr+i,key=*next;if(key*arr)/將待插得數(shù)據(jù)比第一個數(shù)據(jù)小，直接插到最前面。for(1ast=next;next!=arr;next=1ast)*next=*1ast;*arr=key;else/否則從后往前遍歷，找到第一個小于關鍵字得位置插入。for(last=next;key*last;next=last)*next=*last;*next=key;voidOutPutArray(constint*arr,intn)/打印一個數(shù)組?inti;for(i=0;in;+i)printf(”d”，arri)；if

3、(in1)printf(,);printf(n);voidInsertNumber(int*arr,intn)intkey=0,i=0;InsertionSort(arr,n-1);/對之前得n1個數(shù)排序/OutPutArray(arr,n1);/這里可以打印出來瞧一下對之前得數(shù)據(jù)排序就是否正確scanf(%d,&key);/輸入一個數(shù)if(keyarr0)/參照之前得插入排序原理，將這個數(shù)插入到數(shù)組。for(i=n1;0i;-i)arri=arri-1;arr0=key;elsefor(i=n2;keyarri;-i)arri+1=arri;arr+i=key；intmain()intarr

4、10=0;arscanf(%d,%d,%d,%d,%d,%d,%d,%d,%d/輸入9個數(shù),arr+0,arr+1,arr+2,arr+3,arr+4,arr+5,r+6,arr+7,arr+8);InsertNumber(arr,10);/調(diào)用函數(shù)，將輸入得第10個數(shù)插進去.OutPutArray(arr,10);/輸出return(0);3、最大公約數(shù)#includeintfuni(intm,intn)輾轉相除法求m/n得公約數(shù)intr;whi1e(n)r=m%n;m=n;n=r;returnm;intmain()inta，b；scanf(d,%d,&a,&b);/輸入printf(%n”

5、,fun1(a,b);return0;4、奇數(shù)球與#includevstdio、hintmain()intn;intsum(intn);scanf(%d，&n);printf(%dium(n);intsum(intn)intb;if(n1)b=sum(nl)+2*n1;if(n=1)b=1;returnb;5、巧算自然數(shù)#inc1udeintstep=1;voidfc(intn)/輸出n這個數(shù)并按角谷猜想對n做處理以便進入下一步。返回值就是總步數(shù)。if(n(printf(%d),nreturn;elseif(n%2=0)printf(%d,);fc(n2);step+；elseprintf(d

6、,n);fc(n3+1)；step+;intmain(intargc,char*argv)intn;scanf(%d,&n)fc(n);printf(nstep=%dn,step);return0;6、賣鴨子#includestdio、hintmain()staticinti,x8;?x7=2;for(i=7;i=0;i)?xi-1=(xi+1)*2;printf(sum=%dn,x0);for(i=0;i7;i+)?printf(sel1=%d,xi-xi+1);?printf(n);return0；7、各位數(shù)字之與intadd(ints)if(s# includemain()chara10

7、0;inti，j;gets(a);i=0;j=strlen(a)1;whi1e(i=j)printf(犯Sn);elseprintf(Nn”；)指針排序# inc1udevoidsort(int*p,intn);voidsort(int*p,intn)inti,j;1 nttemp=0;for(i=0;ipj+11)temp=pj;Pj=Pj+11；pj+11=temp;intmain0inti；inta10;for(i=0;i10;i+)scanf(%d，&ai);1 nt*p=a;sort(a,10);for(i=0;iv10-1;i+)printf(d，”,(p+)；printf(%dn

8、,*p);return0;查找數(shù)#includestdio、hvoidfind(int*p,intelement,intn);voidfind(int*p,intelement,intn)inti,flag=0;for(i=0;in；i+)flag;?if(element=pi)printf(%d,pi);break;?if(flag=n)?printf(“Non”)?intmain()?inti;?inta10;?for(i=0;iv10;i+)scanf(%d”,&ai);int*p=a;?intnum;scanf(%d,&num);?find(p,num,10);?return0;輸出指

9、定成績#includede,n；intmain()?intgrade34,i,j,(*p)4=grfloatave=0;for(i=0;i3;i+)?Or(j=0;j4;j+)?scanf(%d,&gradeij);scanf(%d,&n);?for(i=0;i3；i+)?rintf(d,*(*(p+n-1)+i)；printf(%n,*(*(p+n-1)+3)?or(i=0;ivoidaverage(intp6,intn);voidaverage(intp6,intn)1 nti;for(i=0;iv4;i+)pn4+=pni;pn5=pn414;voidPrint(intp6,intn)i

10、ntmax1=p05;intmax2=p15;intmax3=p25;1 nti;if(max1max2&maxlmax3)if(max2max3)printf(%d,%d,%d,%dn,p0：0,p：01,p02,p03)；printf(%d,%d,%n，p10,pl1,p12,p13);printf(%d,%d,%d,%dn,p20,p21,p22,p23);e1seprintf(%d,%d,%n，p00,p011,p02,p03);printf。%d,%d,%dn,p20,p21,p2：2,p2)；printf(嫻,%d,%dn,p10,p11,p12,p13);elseif(max2m

11、ax1&max2max3)if(max1max3)printf(%d,%d,%d,%dn,p1：0,p11,p12,p13 )；printf%d,%d,%d,%dn,p00,p01,p02,p03);printf(%d,%d,%d,%n，p20,p21,p22,p23);elseprintf(%d%d,%d,%dn,p10,p11,p12,p13)；printf(%d,%d,%d,%dn,p20,p21,p22,p23);prin t f ( d ,%d ,%d,p00,p01,p02,p03);e1seif(max3max1&max3max2)if(maximax2)printf(%d,%d

12、,%d,%dn”,p20,p21,p22,p23);printf(%d,%d,%d,n”，p0N),p01,p02,p03);printf。%d,%d,%d,%dn,p1：0,p11,p121,P13);elseprintf(%d,%d,%d,%dn,p20,p21,p22,p23)；printf。%d,%d,%d,%dn,p10,p11,p：12,pl3);printf(%d,%d,%d,%dn,p00,p0：1,p0：2,p：03);intmain()inti,j;inta36=0;for(i=0;i3；i+)for(j=。；jv4;j+)scanf(%d,&aij);average(a,

13、i);Print(a,3);return0;統(tǒng)計字符串出現(xiàn)次數(shù)#include#includeintmain()Charstr1100,str2100；intflag=0,counter=0,11,12,i,j;電ets(str1);gets(str2);l1=strlen(str1);12=strlen(str2)；?or(i=0；il1;i+)if(str1i=str20)?or(j=1；jmain()printf(wanglei,86、75n);printf(1ihong,86、50n);printf(zhang1i,79、50n);printf(1iuming,n);printf(AV

14、ERAGE:84、50,86、75,82、50,82n);加密#inc1udestdio、h#includeintl;voidgm(char*a);main()?chars100=0;gets(s);?1=strlen(s);?gm(s);voidgm(char*a)inti;?chard：100=0;?for(i=0;il;i+)?switch(ai)?casea:di=dz;break;caseb/:di=/w7;break;?case2di=，k;break;?casea:di=一；break;?casee珂=;ibreak;?caseidi=areak;?case1：di=b;brea

15、k;case7;:di=/c;break;?casew:di=fbreak;default:di=ai;?puts(d);學生成績#inc1udestdio、hstructadeintno;intam；intbm;intcm；;structadeN3=1,70,80,90,2,75,85,95,3,88,84,65;main()?chars300;inti=0,k,m;for(i=0;i#includestdlib、htypedefstructCharcharch;charintch;structChar*next;CHARintmain(void)CHAR*node=NULL;CHAR_*c

16、h_=NULL;CHAR_*hcar=NULL;charzimu=a；charpanduanzimu;charrecord;for(;zimu!=ezimu+)ch_=(CHAR_*)malloc(sizeof(CHAR_);if(ch_=NULL)exit(0);ch_ch=zimu;ch_next=NULL;if(node=NULL)node=ch;e1senodenext=ch_;node=nodenext;if(hear=NULL)hear=node;for(zimu=2;zimu!=(-al);zimu-)ch=(CHAR*)malloc(sizeof(CHAR);if(ch=NUL

17、L)exit(。)；chch=zimu;ch_-next=NULL;nodenext=ch;node=node-next;for(node=hear,zimu=0;node!=NULL;node=node-next,zimu+)nodeintch=zimu;scanf(%c,&panduanzimu);node=hear;ifPpanduanzimu=&panduanzimuintch)printf(%c,node-ch);break;nodenodenext;elseif(panduanzimu=/a&panduanzimuch)record=nodeintch;node=nodenext;

18、printf(%c,record);elseprintf(N;nodehear；while(node!=NULL)hear=node-next;free(node);node=hear;return0;鏈表合并#includetring、hi,j,m,n;?staticcharq,x100,y100,z100;ets(x);strcatm=str1?for(j=0;gets(y);(x,y);en(x);jm;j+)?for(i=0;imj;i+)?q=xj；?if(xjxJ+i)?伙j=xj+i;?伙J+i=q;?)7or(i=0;i0;i-)?if(isalpha(zi)?m=i;?bre

19、ak;?for(i=0;iintmain()inti,j,k=0;chara：100,b100,c100;gets(a);for(i=0;ai!=ni+)printf(%c,ai);k+;printf(n);for(i=k+1;ai!=0&ai!=n;i+)printf(%ai)；k；if(ai=nz&ai+1!=0)for(i=k+2;ai!=0;+i)Printf(%c，ai);字符串反向#includevstdio、hnincludeintmain()charstr80,c;inti,j,n;gets(str);n=strlen(str);for(i=0,j=n-1;ij;i+,j-)c=st