复试-机试06-13真题代码语言版

#include<alogrithm>usingnamespacestd;栈#include<stack>usingnamespacestd;s.empty();//trueorfalse#include<queue>usingnamespacestd;堆#include<queue>usingnamespacestd;#includevector>usingnamespacestd;structEdge{intcost;//该边权重

for(inti=0;i<N;++i)Edgetmp;edge[i].push_back(tmp);//i的邻接edge[i].size();//i{inttnode=edge[2][i].node;//当二维int}C接用ch=getchar();来取。scanf("%s",str);//把’\n转换成字符区中必须用getchar();ch=getchar来创建一棵二叉树，voidcreat(bit&t)//新建一棵树,bit是指针类型fgetsgets函数时，注意’\n’与’\0’之间的转换，从文件中时回while(scanf(“%s”,str)!=EOF不太好用#include<stdio.h>intmain(intargc,char*{FILE*fp,*fp2;intmax,a;{}return0;}#include<stdio.h>#include<stdlib.h>intmain(intargc,char*

#include<stdio.h>#include<stdlib.h>intmain(intargc,char*{FILEint{}return0;}{FILE*fp,*fp2;intsum=0,x;{}return0;

#include<stdio.h>#include<stdlib.h>#includeintjudge(int{intreturn}intmain(intargc,char*{FILE*fp,*fp2;intcount,x,y;for(inti=2;i<=y;++i)return0;}

{}return0;#include #include#include inttot=0,n;intvis[3][17];voidsearch(int{inti;elsefor(i=0;i<n;i++){{}}}intmain(intargc,char*{FILE*fp,*fp2;

#include<stdio.h>#include<stdlib.h>#includeintmain(intargc,char*{FILEcharstr[10001],pstr[1001];intlen,len2,k,sign;{{for(intj=1;j<len2;++j)

}}{intmain(intargc,char*{double}lnode}int}p=(lnodereturn}#include<stdio.h>#include<stdlib.h>intFILE*fp,*fp2;typedefstructlnode{doubledata;structlnode*next;structlnode*left;structlnodevoidpresearch(lnode*p,int{{if(!p->left&&!p-{for(inti=0;i<t;++i)}

{{s=s-}}{{s=s-}}return}

intintsign=0,count=0,c2=0;charstr[20],str2[20];if(!fp||!fp2)exit(-{}{}{{}#include<stdio.h>#include<stdlib.h>#include<string.h>#include<math.h>

}

intmain(intargc,char*{FILEreturndouble}int#include<stdio.h>#includeintmain(intargc,char*{FILEint{}{}fprintf(fp2,"%d%dreturn}#include<stdio.h>#include<stdlib.h>#includeint

intintbooldfs(int{{if(c[v]<0)returnfalse;elseif(!c[v]&&!dfs(v))return}returntrue;}bool{for(intu=0;u<n;u++)if(!c[u])if(!dfs(u))returnfalse;}intmain(intargc,char*{FILE*fp,*fp2;charstr[100];intlen,sign,x;booltt=false;{{if(str[i]<='9'&&{p=(train}elseg[x][str[i]-{}fscanf(fp,"%d%d}}{{{return}}#include<stdio.h>#include<stdlib.h>typedefstructtrain{intstart;intend;int

elseif(t.end>p[j].start&&t.end<=p[j].end||t.start<=p[j].start&&||t.start>=p[j].start&&{{}intmain(intargc,char* FILE train

{

}{}}

}return{#include#include#includeif(!v[j]&&#defineINFintmain(intargc,char*{FILE{intintint}}if(!fp||{fscanf(fp,"%d%d%dv=(int{d=(intr=(intif(!mx||!v||!d||}}{printf("can'treturn}}{fscanf(fp,"%d%d#include}#includeintmain(intargc,char*{{FILE{intint{

种红球,",j,"种黄球,",k,"种黑球}}}}{}}return}return0;}#include<stdio.h>#include<stdlib.h>intmain(intargc,char*{

#include<stdio.h>#include<stdlib.h>intmain(intargc,char*{FILE*fp;charch;intsign=0;FILEintcount=0;{fprintf(fp,"%s%d%s\n","这{

{if(!sign&&{}elseif(sign&&{{}

while(fscanf(fp,"%d%d%d",&x,&y, return0;}

#include<stdio.h>#include<stdlib.h>FILE

typedeftypedefstruct}structlnodestructlnodeintreturnvoidmidsearch(lnode}{{}}

#include<stdio.h>#include<ctype.h>#includecharintintmain(intargc,char*{

intmain(intargc,char{lnode*p;int

char{if(ch<'0'||ch>'9'){if(t>1&&s==a[t-}}}

typedefstructlnode{intdata;structlnodeelsevoidcreateT(link{intlink;}}else}int{{else{}}{elseelse}}}{}}s-returns-}}}#include}#includevoidpostT(link{{printf("%d",p-}}intmain(intargc,char*{linkreturn}#include<stdio.h>#include<stdlib.h>intmain(intargc,char*{int

#include<stdio.h>#include<stdlib.h>#include<algorithm>usingnamespaceintmain(intargc,char*{int*p,count=0;intx,size=100;p=(int*)malloc(100*sizeof(int));{{}}printf("%d{}return}#include<stdio.h>#include<stdlib.h>FILEint}returntypedefstructlnode{structlnode*left;structlnode*right;chardata;voidcreateTree(link&q,int{char{}}voidorderT(linkp,int{{}}}

return}#includeintmain(intargc,char*{intx,count=0;{}return0;}#include<stdio.h>#include<stdlib.h>structlnode{structlnode*next;intno;intmain(intargc,char*intmain(intargc,char*{linkif(!fp||!fp2)

intlnodescanf("%d%d",&m,&k);q=p=(lnode*)malloc(sizeof(int));{r=(lnode*)malloc(sizeof(int));}

max[k][i]=(int*)}{{{}{return0;}#include<stdio.h>#include<stdlib.h>intmain(intargc,char*

}}}{FILE*fp,*fp2;intm,n,x,s;int**mx,**mx2;inti,j,k;if(!fp||!fp2)

return0;}#include<stdio.h>#include<stdlib.h>#includeintmain(intargc,char*{{

FILEcharstr[1000],str2[20];intlen,count=0,t=0;if(!fp||

}

return{for(inti=0;i<len;i++){if(str[i]==''||{}}

#include<stdio.h>#include<stdlib.h>intmain(intargc,char*{FILE*fp,*fp2;intm,n,x;int**mx,**mx2;inti,j;intif(!fp||!fp2)}

return0;

fscanf(fp,"%d%d",&m,&n);mx=(int**)malloc(m*sizeof(int*));{#includeintmain(intargc,char*{intint{}

}mx2=(int**)malloc(n*sizeof(int*));{mx2[i]=(int}}{{{if(str[i]==''||||i==len-}{}

&&}

return0;

q=(lnode*)#include<stdio.h>#include<stdlib.h>#includetypedefstructlnode{structlnode*next;charword[40];intintmain(intargc,char*{FILE*fp,*fp2;charintn,count=0,len;intt,x;

{{}}if(!fp||!fp2)

{

}}}{

{{}

{{

return}}}

#include<stdio.h>#include<stdlib.h>#include<string.h>#include<algorithm>usingnamespace}return0;}#include<stdio.h>#include<string.h>intmain(intargc,char*{charstr[15];intlen;int

structintf,e;intdata;intintintboolcmp(edgex,edge{}voiddfs(int{int{{{}}}}{}if(v[head[i].f]&&{intmain(intargc,char*{

FILE*fp,*fp2;edge*head;inti,j;if(!fp||!fp2)head=(edge*)v=(int*)malloc(n*sizeof(int));mx=(int**)malloc(n*sizeof(int*));if(!mx||!head||!v){

{}}{}}mx[i]=(int}{fscanf(fp,"%d%d%d",&head[i].f,&h

fprintf(fp2,"%d%d%d\n",head[i].f,return0;}#include<stdio.h>#include<stdlib.h>#includestructstructlnodestructlnode*right;chardata;FILE*fp,*fp2;lnode*head;intlen,count=0;voidfunc(lnode*&p,int{lnode

intmain(intargc,char*{inti;lnode*h;if(!fp||!fp2){}{{}}{}}voidpre(lnode{return}{}}

#include<stdio.h>#include<string.h>intmain(intargc,char*{charintusingnamespaceintmain(intargc,char*{intFILE{intif(str[i]=='int{if(i)printf("if(!fp||}}return}si=(intif(!mx||#include#includeintmain(intargc,char*{{mx[i]=(intintint}while(fscanf(fp,"%d{if(x==0&&}

return

#include<stdio.h>#include<stdlib.h>#include#include

fprintf(fp2,"%d",x);}return0;}

case'+':a=0;break;case'-':a=1;break;case'*':a=3;break;case'/':a=4;break;}#include<stdio.h>#include<stdlib.h>#include#include<stack>usingnamespacestd;intmain(intargc,char*{FILE*fp,*fp2;charstr[100];intx,y,z;intif(!fp||!fp2)

{{&&{elseif(b==1)z=x-y;elseif(b==3)z=x*y;elsez=x/y;{if(str[i]>='0'&&{}

}}}

{

{{if(str[i]>='0'&&{}else{else}{

return0;

case'+':a=0;break;case'-':a=1;break;case'*':a=3;break;case'/':a=4;break;case'(':case')':a=0;break;#include<stdio.h>#include<stdlib.h>#include

#include<stack>usingnamespacestd;#definetypefloatintmain(intargc,char*{FILE*fp,*fp2;charstr[100];typex,y,z;

{

if(a>b+1||b==6){&&!sc.empty()){intif(!fp||!fp2)

{charelseintelse{}if(!sign&&if(!isalpha(str[0])&&}{}}}}&&!isdigit(str[i])&&{}return}#includeelse#includeelse#include}intvoidfunc(intm,intn,intcount,int{intreturn}{#include<stdio.h>#include<string.h>#includeintmain(intargc,char*

}

printf("%d",p[j]);{}}intmain(intargc,char*{intwhile(scanf("%d{p=(int}return}#include<stdio.h>#include<stdlib.h>#includeintcount=0,s=0;int*v,**mx,n;voidfunc(int{intif(mx[x][i]&&}intmain(intargc,char*{FILEint

inti,j;intx,y;if(!fp||!fp2)v=(int*)malloc(sizeof(int));mx=(int**)malloc(sizeof(int*)*n);if(!mx||!v){mx[i]=(int}{}{{}fprintf(fp2,"%d",i);return0;}#includeintmain(intargc,char*{intn,a[100];inti,sign=0;intmax=0,s=0;intl,m,t;{if(!sign&&a[i]>0){}}{{{}}{

#include<stdio.h>#include<stdlib.h>intmain(intargc,char*{int;intFILE{ printf("%d%d\n",y,m);{if(y%4==0&&y%100!=0}}return0;}#include} intprintf("%d%d%d\n",l,m,max);return0;}

intvoidfunc(intj,ints,int{}{pr