语言超经典算法详细分析100例_第1页
语言超经典算法详细分析100例_第2页
语言超经典算法详细分析100例_第3页
语言超经典算法详细分析100例_第4页
语言超经典算法详细分析100例_第5页
已阅读5页,还剩74页未读, 继续免费阅读

付费下载

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

C1001、2、3、4。组成所有的排列后再去{inti,j,k; for(k=1;k〈{if(i!=k&&i!=j&&j!=k) /*确保i、j、k*/}}21.5{longintintbonus1,bonus2,bonus4,bonus6,bonus10,bonus; elseif(i〈=200000)elseif(i〈=400000)elseif(i〈=600000)elseif(i〈= 〉3#include{longintfor(i=1;i〈100000;i++{x=sqrt(i+100); /*x为加上100后开方后的结果*/ })4{intday,month,year,sum,leap;printf(“\npleaseinputyear,month,day\n“);{case1:sum=0;break;case2:sum=31;break;case3:sum=59;break;case4:sum=90;break;case5:sum=120;break;case6:sum=151;break;case7:sum=181;break;case8:sum=212;break;case9:sum=243;break;case10:sum=273;break;case11:sum=304;break;casedefault:printf(“data} printf(“Itisthe%dth5xxyx〉yxxzx〉zxz{intx,y,z,t;if(x〉y){t=x;x=y;y=t;}/*x,y*/{t=y;y=z;z=t;}/*z,y*/printf(“smalltobig:%d%d%d\n“,x,y,z);}6#include{printf(“oC-world!\n“);printf(“****\n“);printf(“*\n“);printf(“*\n“);printf(“****\n“);}7c,Very#include{chara=176,b=219;89*9#include{inti,j,result;for(i=1;i〈10;i++)for(j=1;j〈{}}}9#include{inti,j;{printf(“}}10i,j,ji#include{int{}}111,1,2,3,5,8,13,21....{longf1,f2;inti;{printf(“%12ldif(i%2==0)printf(“\n“);/*控制输出,每行四个*/f1=f1+f2;/*前两个月加起来赋值给第三个月*/f2=f1+f2;/*前两个月加起来赋值给第三个月*/}}12#include{intm,i,k,h=0,leap=1;{k=sqrt(m+1);if(leap){printf(“%-}}printf(“\nThetotalis}13{intprintf(“’waterflower’numberis:“);{{}}}14(1)n,则说明分解质因数的过程已经结束,打印出即可。n〈〉k,nkknkn,/*zhengintisdividedyinshu*/{intprintf(“\npleaseinputanumber:\n“);{{{printf(“%d*“,i);}}}15B{intscore;charprintf(“pleaseinputascore\n“);printf(“%dbelongsto}16mn,求其最大公约数和最小公倍数。{intprintf(“pleaseinputtwonumbers:\n“); }{}}17whilen’.#include{charintletters=0,space=0,digit=0,others=0;printf(“pleaseinputsomecharacters\n“);{elseif(c==’’)elseif(c〉=’0’&&c〈=’9’)}printf(“allinall:char=%dspace=%ddigit=%dothers=%d\n“,letters,}18 {inta,n,count=1;longintsn=0,tn=0;printf(“pleaseinputaandn\n“);{}}191000{staticintk[10];inti,j,n,s;{ {}}{printf(“%disawanshu“,j); }}}20{floatsn=100.0,hn=sn/2;intn;{hn=hn/2;/*n*/}printf(“thetotalofroadis%f\n“,sn);printf(“thetenthis%fmeter\n“,hn);}21第二天早上又将剩下的桃子一半,又多吃了一个。以后每天早上都吃了前一{intday,x1,x2;}printf(“thetotalis}22三队赛手的{chari,j,k;/*ia,j是b,kc*/{{{printf(“orderisa--%c\tb--%c\tc--}}}}23题目:打印出如下图案(菱形**

先把图形分成两部分来看待,前四行一个规律,后三行一个规律,利{inti,j,k;{printf(““);}{printf(““);}}24{intn,t,number=20;floata=2,b=1,s=0;{}printf(“sumis}25{floatn,s=0,t=1;{}}26递归#include{intintfact();}intfact(j)intj;{intsum;returnsum;}275#include{intvoidpalin(int}voidpalin(n)intn;{charnext;{}{}}28题目:有5个人坐在一起,问第五个人多少岁?他说比第4个2岁。问第4个人岁3个2岁。问第三个人,又说比第2两岁。问第2个人,说比第一个第四人的岁数,依次类推,推到第一人(10),int{intc;if(n==1)c=10;elsec=age(n-1)+2;}{}29main({longif(a!=0)printf(“thereare5,%ld%ld%ld%ldelseif(b!=0)printf(“thereare4,%ld%ld%ld%ld\n“,e,d,c,b);elseif(c!=0)printf(“thereare3,%ld%ld%ld\n“,e,d,c);elseif(d!=0)printf(“thereare2,%ld%ld\n“,e,d);elseif(e!=0)printf(“thereare1,%ld\n“,e);}30main({longge,shi,qian,wan,x;if(ge==wan&&shi==qian)/*个位等于万位并且十位等于千位*/printf(“thisnumberisahuiwen\n“);printf(“thisnumberisnota}31#includestdio.hvoid{charprintf(“pleaseinputthefirstletterofsomeday\n“);while((letter=getch())!=’Y’)/*Y*/{switch{case’S’:printf(“pleaseinputsecondletter\n“);elseif((letter=getch())==’u’)elseprintf(“dataerror\n“);case’F’:printf(“friday\n“);break;casecase’T’:printf(“pleaseinputsecondletter\n“);elseif((letter=getch())==’h’)elseprintf(“dataerror\n“);case’W’:printf(“wednesday\n“);break;default:printf(“dataerror\n“);}}}32题目:Pressanykeytochangecolor,doyouwanttotryit.Pleasehurry#includeconio.hvoid{intfor(color=0;color8;{cprintf(“Thisiscolor%d\r\n“,color);cprintf(“Pressanykeytocontinue\r\n“);}}33#includeconio.hvoid{gotoxy(1,5);/*定位函数*/cprintf(“Outputatrow5column1\n“);gotoxy(20,cprintf(“Outputatrow10column}34#includestdio.hvoid{printf(“o,}voidthree_{intfor(counter1;counter3;counter++)}void{}35#includeconio.hvoid{intfor(color=1;color16;{cprintf(“Thisiscolor%d\r\ncolor);}textcolor(128+15);cprintf(“Thisisblinking\r\n“);}36100#includestdio.h〉#include“math.h“#defineN101{intfor(i=2;i〈N;i++)a[i]=i;{for(i=2,line=0;i〈{}}37#defineN10{int/*inputprintf(“pleaseinputtennum:\n“);{/*sorttennum*/if(a[min]〉a[j])min=j;}/*outputdata*/printf(“Aftersorted\n“);}38{floata[3][3],sum=0;inti,j;printf(“pleaseinputrectangleelement:\n“);printf(“duijiaoxianheis}39后此元后的数,依次后移一个位置{intinttemp1,temp2,number,end,i,j;printf(“originalarrayis:\n“);printf(“insertanewnumber:“);{for(i=0;i〈if(a[i]〉}}}}}40#defineN5{inta[N]={9,6,5,4,1},i,temp;printf(“\noriginalarray:\n“);}printf(“\nsortedarray:\n“);}41#include{intstaticintstatic_var=0;printf(“\40:varequal%d\n“,var);printf(“\40:staticvarequal%d\n“,static_var);}void{int}42#include{inti,num;for(i=0;i〈}}{printf(“\40:Thenumequal%d\n“,num);{autointprintf(“\40:Theinternalblocknumequal%d\n“,num);}}}43static#include{inti,num;{printf(“\40:Thenumequal%d\n“,num);{staticintprintf(“\40:Theinternalblocknumequal%d\n“,num);}}44external#includeinta,b,c;void{inta;}void{printf(“Thevalueofcisequalto}45void{registerinti;inttmp=0;printf(“Thesumis46#include#defineTRUE#defineFALSE0#defineSQ(x)(x)*(x)voidmain(){intintprintf(“\40:Programwillstopifinputvaluelessthan50.\n“);{printf(“\40:Pleaseinputnumber==〉“);printf(“\40:Thesquareforthisnumberisd\n“,SQ(num));}}47#include#defineexchange(a,b)/*宏定义中允许包含两道衣裳命令的情形,此时必须在最右intt;\}void{intx=10;intprintf(“x=%d;y=%d\n“,x,y);printf(“x=%d;}48#defineLAG〉#defineSMA〈#defineEQ==#includestdio.h“voidmain(){inti=10;intj=20;if(iLAGj)printf(“\40:%dlargerthan%delseif(iEQprintf(“\40:%dequalto%d\n“,i,j);elseif(iSMAj)printf(“\40:%dsmallerthan%d\n“,i,j);printf(“\40:Nosuch}49题目:#if#ifdef#ifndef#include#define#defineUM(x,y)(x〉y)?x:y#defineMINIMUM(x,y)x〉y)?y:xvoidmain(){inta=10,b=20;#ifdefMAXprintf(“\40:Thelargeroneis%d\n“,UM(a,b));printf(“\40:Theloweroneis%d\n“,MINIMUM(a,b));#ifndefprintf(“\40:Theloweroneis%d\n“,MINIMUM(a,b));printf(“\40:Thelargeroneis%d\n“,UM(a,b));#undefMAX#ifdefprintf(“\40:Thelargeroneis%d\n“,UM(a,b));printf(“\40:Theloweroneis%d\n“,MINIMUM(a,b));#defineMIN#ifndefprintf(“\40:Theloweroneis%d\n“,MINIMUM(a,b));printf(“\40:Thelargeroneis%d\n“,UM(a,b));}50题目:#includetest.h#defineLAG〉#defineSMA〈#defineEQ==#includetest.h/*50.c,test.h*/#include“stdio.h“void{inti=10;intj=20;if(iLAGj)printf(“\40:%dlargerthan%d\n“,i,j);elseif(iEQj)printf(“\40:%dequalto%d\n“,i,j);elseif(iSMAj)printf(“\40:%dsmallerthan%d\n“,i,j);printf(“\40:Nosuch}51&0&0=0;0&1=0;1&0=0;#include{inta,b;printf(“\40:Thea&b(decimal)is%d\n“,b);printf(“\40:Thea&b(decimal)is%d}52|0|0=0;0|1=1;1|0=1;#include{inta,b;printf(“\40:Thea&b(decimal)is%d\n“,b);printf(“\40:Thea&b(decimal)is%d}53题目:学习使用按位异或^0^0=0;0^1=1;1^0=1;#include{inta,b;printf(“\40:Thea&b(decimal)is%d\n“,b);printf(“\40:Thea&b(decimal)is%d}54{unsigned}55题目:学习使用按位取反~0=1;#include{inta,b;printf(“\40:Thea’s1complement(decimal)is%d\n“,b);printf(“\40:Thea’s1complement(hexidecimal)is%x}56circle#include{intfloatj=1,k=1;{}}57line#include{intdriver,mode,i;floatx0,y0,y1,x1;floatj=12,k;{{}}58#include{intx0,y0,y1,x1,driver,mode,i;{}outtextxy(150,40,“Howbeautifulitis!“);}59#definePAI3.#defineB#include“graphics.h“#include“math.h“{inti,j,k,x0,y0,x,y,driver,mode;floata;{setcolor(2);line(x0,y0,x,y);}/*Make0timenormalsizeletters*/outtextxy(10,170,“pressakey“);{{setcolor(2);line(x0,y0,x,y);}{}}}60#include#defineLEFT#defineTOP#defineRIGHT#defineBOTTOM#defineLINES#defineMAXCOLOR15{intdriver,mode,error;intx1,y1;intintdx1,dy1,dx2,dy2,i=1;intcount=0;intcolor=0;{{color=(color〉}}}611 1010 {intint}}62#include“stdio.h“#include“graphics.h“{inti,j,driver=VGA,mode=VGAHI;}63#include“stdio.h“#include“graphics.h“#include“conio.h“{intx=360,y=160,driver=VGA,mode=VGAHI;intnum=20,i;inttop,bottom;{}}64ellipseandrectangle#include“stdio.h“#include“graphics.h“#include“conio.h“{intdriver=VGA,mode=VGAHI;inti,num=15,top=50;intleft=20,right=50;{}}65#include“graphics.h“#include“math.h“#include“dos.h“#include“conio.h“#include“stdlib.h“#include“stdio.h“#include“stdarg.h“#defineMAXPTS15#definePI3.structPTS{intx,y;doubleAspectRatio=0.85;voidLineToDemo(void){structviewporttypevp;structPTSpoints[MAXPTS];inti,j,h,w,xcenter,ycenter;intradius,angle,step;doubleprintf(“MoveTo/LineToDemonstration“);getviewsettings(&vp);h=vp.bottom-vp.top;w=vp.right-xcenter=w/2;/*Determinethecenterofcircleycenter=h/radius=(h-30)/(AspectRatio*step=360/MAXPTS;/*Determine#ofincrements*/angle=0;/*Beginatzerodegrees*/for(i=0;i〈MAXPTS;++i){/*Determinecircleintercepts*/rads(double)angle*PI180.0;/*Convertangletoradians*/points[i].x=xcenter+(int)(cos(rads)*radius);points[i].y=ycenter-(int)(sin(rads)*radius*AspectRatio);angle+=step;/*Movetonextincrement*/}circle(xcenter,ycenter,radius);/*Drawboundingcircle*/for(i=0;i〈MAXPTS;++i){/*Drawthecordstothecircle*/for(j=i;j〈MAXPTS;++j){/*Foreachremainingintersect*/moveto(points[i].x,points[i].y);/*Movetobeginningofcord*/lineto(points[j].x,points[j].y);/*Drawthecord*/}}{intdriver,mode;66{intint*pointer1,*pointer2,*pointer3;printf(“pleaseinput3number:n1,n2,n3:“);if(n1〉n2)swap(pointer1,pointer2);if(n1〉n3)swap(pointer1,pointer3);if(n2〉n3)printf(“thesortednumbers}int{intp;}67{intnumber[10];}intnumber[10];{inti;}int{int*max,*min,k,l;int*p,*arr_end;if(*p〉*max)max=p;elseif(*p〈*min)min=p;}int{int}68{intnumber[20],n,m,i;printf(“thetotalnumbersis:“);printf(“back}int{int*p,array_end;*p=*(p-if(m〉0)}69#definenmax50{intprintf(“pleaseinputthetotalofnumbers:“);{if(*(p+i)!=0)k++;{*(p+i)=0;if(i==n)}while(*p==0)p++;printf(“%disleft\n“,*p);}70{intcharprintf(“pleaseinputastring:\n“);printf(“thestringhas%d}char*p;{intn;{}return}71#defineN5struct{charnum[6];charname[8];int}stu[N];structstudent{inti,j;{printf(“\npleaseinput%dof%d\n“,i+1,N);printf(“num:“);printf(“name:“);{printf(“score}}}structstudent{intprintf(“\nNo.NameSco1Sco2Sco3\n“);printf(“%-6s%-10s“,stu[i].num,stu[i].name);}}{}72/*creatalist*/#include“stdlib.h“#include“stdio.h“structlist{intstructlisttypedefstructlistnode;typedefnode*link;void{linkptr,head;intnum,i;printf(“pleaseinput5numbers==〉\n“);{if(i==4)ptr-〉next=NULL;elseptr=ptr-〉}printf(“Thevalueisd\n“,ptr-〉data);}}73/*reverseoutputalist*/#include“stdlib.h“#include“stdio.h“structlist{intstructlisttypedefstructlistnode;typedefnode*link;void{linkptr,head,tail;intnum,i;printf(“\npleaseinput5data==〉\n“);{}printf(“Thevalueisd\n“,ptr-〉data);74#include#includestruct{intstructlisttypedefstructlistnode;typedefnode*link;linkdelete_node(linkpointer,link{if(tmp==NULL)/*deletefirstnode*/returnpointer-〉next;if(tmp-〉next-〉next==NULL)/*deletelastnode*/else/*deletetheothernode*/return}}voidselection_sort(linkpointer,int{linktmp,btmp;inti,min;{if(min〉tmp-〉next-〉}}printf(“\40:%d\n“,min);}}linkcreate_list(intarray[],int{linktmp1,tmp2,pointer;inti;tmp2=(link)malloc(sizeof(node));}return}linkconcatenate(linkpointer1,link{linktmp;returnpointer1;}void{intlinkptr;}75{inti,n;{printf(“zhuhaoshide}}76#include{floatpeven(),podd(),dcall();floatsum;intn;while(1){{}{}}floatpeven(int{floats;inti;}floatpodd(n)intn;{floats;inti;}floatdcall(fp,n)float(*fp)();intn;{floats;}77题目:填空练习(指向指针的指针{char*s[]={“man“,“woman“,“girl“,“boy“,“sister“};char**q;int }}78题目:找到最大的人,并输出。请找出程序中有什么问题#defineN#includestaticstruct{charname[20];intage;}[N]={“li“,18,“wang“,19,“zhang“,20,“sun“,22};{structman*q,*p;inti,m=0;for(i=0;i〈}79{char*str1[20],*str2[20],*str3[20];charswap();printf(“pleaseinputthreestrings\n“);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(“afterbeingsorted\n“);}charswap(p1,p2)char*p1,*p2;{char*p[20];}80{inti,m,j,k,count;{count=0;{}}}81题目:809*??=800*??+9*??+1,8*??的结果为两位数,9*?output(longb,long{}{longinta,b,i;for(i=10;i〈output(b,i);}}82{char*p,s[6];intn;}83{longsum=4,s=4;intj;for(j=2;j〈=8;j++)/*jisceofprintf(“\n%ld“,sum);}84#include“stdio.h“#include“math.h“{intfor(c=2;c〈=sqrt(b);c++)if(b%c==0)break;if(d%c==0)break;}}85{longintm9=9,sum=9;intzi,n1=1,c9=1;{if(!(sum%zi))}}printf(“%ld,canbedividedby%d}86#include{chara[]=“acegikm“;charb[]=“bdfhjlnpq“;charc[80],*p;inti=0,j=0,k=0;{if(a[i]{c[k]=a[i];i++;}}87题目:回答结果(结构体变量传递#includestruct{intx;

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

评论

0/150

提交评论