参考答案一、填空题1.(1)double(2)f1(3)f22.(1)struct student(2)n-1(3)a[i].name,a[j].name3.(1)0(2)x[i]/N(3)j++4.(1)k(2)N(3)a[k][i]5.(1)'0'(2)s++(3)ctod(a)+ctod(b)6.(1)0(2)n(3)(t*t)7.(1)j(2)0(3)i++8.(1)N(2)k(3)ss[i]9.(1)a(2)(3)score[i]10.(1)[M](2)N(3)011.(1)t,s(2)s[i](3)012.(1)j(2)k(3)p13.(1)999(2)t/10(3)x14.(1)48(2)s++(3)sum15.(1)h->next(2)p->next(3)>=16.(1)struct student *(2)a->score[i](3)a17.(1)s/N(2)j++(3)-118.(1)n++(2)0(3)s++19.(1)N(2)i(3)-120.(1)a[0][i](2)<(3)x,y21.(1)s(2)--(3)return 022.(1)feof(fp)(2)==sno(3)sizeof(STU)23.(1)->sno(2)->name(3)&t24.(1)x[i]/N(2)j++(3)i++25.(1)0(2)i++(3)2.*i26.(1)[N](2)i(3)i+127.(1)double(2)f1(3)f228.(1)FILE *(2)fclose(fp)(3)fp29.(1)1(2)2*i(3)(-1)30.(1)filename(2)SEEK_END(3)&n31.(1)*av(2)i(3)x[j]32.(1)FILE *(2)fp(3)ch33.(1)struct student(2)(3)a.score[i]34.(1)i(2)ps[i](3)tp 35.(1)s[i](2)k(3)036.(1)3.(2)>(3)(2*i+1)37.(1)10(2)0(3)x38.(1)0(2)x(3)t++39.(1)0(2)||(3)140.(1)k(2)N-1(3)temp41.(1)N(2)break(3)n42.(1)p->next(2)q(3)p->next43.(1)h->next(2)p==0(3)r44.(1)0(2)10*x(3)n/1045.(1)N(2)substr(3)046.(1)1(2)s(3)i*1047.(1)"rb"(2)>s[j].sno(3)fwrite48.(1)*s(2)1(3)k[n]49.(1)*s(2)s++(3)n50.(1)NODE *(2)q(3)r51.(1)->sno(2)->name(3)&t52.(1)0(2)i++(3)2.*i53.(1)j++(2)s[i]=t1[i](3)j54.(1)[N](2)t[i][j](3)t[j][i]55.(1)t=i(2)i(3)056.(1)next(2)t->data(3)t57.(1)sum=0(2)t[i][i](3)158.(1)999(2)t/10(3)x59.(1)10(2)0(3)x60.(1)0(2)10*x(3)n/1061.(1)1(2)j++(3)j62.(1)M(2)<(3)k63.(1)*fw(2)str(3)str64.(1)1(2)i(3)a[p+i]65.(1)N(2)k(3)ss[i]66.(1)3.(2)>(3)(2*i+1)67.(1)s[i](2)'9'(3)*t=n68.(1)a[i](2)a[j](3)a[j]69.(1)0(2)x(3)t++70.(1)i++(2)m(3)m71.(1)a[i]%2(2)a[j](3)j72.(1)s[i](2)k(3)073.(1)0(2)n(3)(t*t)74.(1)1(2)s[k](3)c75.(1)*n(2)next(3)head76.(1)N(2)N-1(3)077.(1)N(2)i(3)-178.(1)struct student *(2)a->score[i](3)a79.(1)q(2)next(3)next80.(1)(fp)(2)==(3)fp81.(1)&&(2)0(3)s[j]82.(1)struct student(2)(3)a.score[i]83.(1)1(2)2*i(3)(-1)84.(1)char(2)ch<='9'(3)'0' 85.(1)data(2)next(3)head86.(1)0(2)n(3)head,ch87.(1)x(2)p(3)s88.(1)STYPE(2)FILE(3)fp89.(1)0(2)j--(3)j90.(1)t[][N](2)i=0;i<n(3)s91.(1)0(2)0(3)c92.(1)a(2)(3)score[i]93.(1)[M](2)N(3)094.(1)"r"(2)fs(3)ft95.(1)1(2)s(3)i*1096.(1)fp(2)fclose(fp)(3)fname97.(1)struct student(2)n-1(3)a[i].name,a[j].name98.(1)n/2(2)i(3)a[n-i-1]99.(1)*a(2)2(3)i+1100.(1)N(2)substr(3)0二、改错题1.(1)char *fun(char *s,char *t)(2)ss++;(3)tt++;2.(1)q=p+i;(2)while(q>p)3.(1)double fun(int m)(2)for(i=100;i<=m;i~1+=0)4.(1)for(i = strlen( t )-1; i;i--)(2)if(t[j] > t[j + 1 ] )5.(1)void fun ( char *s, int *a, int *b )(2)++(*a); (3)++(*b);6.(1)for(i=0;str[i];i++)(2)if(substr[k+1]==0)7.(1)for(i=2;i<=m;i++)(2)y-=1.0/i/i;8.(1)int k=0;(2)while( *p || *q )9.(1)s[j++]=s[i];(2)s[j]=0;10.(1)t=1;(2)return(2*s);11.(1)if(i%k==0)(2)if(k>=i)12.(1)while(i<j)(2)if(*a)13.(1)void fun(long s,long *t)(2)while(s>0)14.(1)if ((k%13 == 0) || (k%17 == 0))(2)}15.(1)p=h->next;(2)p=p->next;16.(1)char *fun( char (*sq)[M] )(2)return sp;17.(1)#include "stdio.h"(2)upfst(char *p)18.(1)t+=s[k];(2)*aver=ave;19.(1)a2=k/10;(2)return i;20.(1)int fun(int *x,int *y)(2)t=*x;*x=*y;*y=t;21.(1)double fun (int n)(2)c=a;a+=b;b=c; 22.(1)n=strlen( aa ) ;(2)ch=aa[i];23.(1)double fun(double a,double x0)(2)if(fabs(x1-x0)>0.00001)24.(1)num[k]=0;(2)switch(*s)25.(1)void fun (char *s, char *t)(2)t[2*d] = 0;26.(1)aa[i]=m%k;(2)printf("%d",aa[i-1]);27.(1)p=h->next;(2)p=p->next;28.(1)t=(STU *)calloc(sizeof(STU),m);(2)t[k]=b[j];29.(1)k++;(2)if(m==k)30.(1)p=(NODE *)malloc(sizeof(NODE));(2)return h;31.(1)float fun(int n)(2)for (i=2; i<=n; i++)32.(1)s[j++]=s[i];(2)s[j]=0;33.(1)if(p==n) return -1;(2)a[i]=a[i+1];34.(1)double fun(int n)(2)return sum;35.(1)while(*w)(2)if(*r==*p)36.(1)double fun(int n)(2)s=s+(double)a/b;37.(1)if (n==0)(2)result *= n-- ;38.(1)int i,sl;(2)t[i]=s[sl-i-1];39.(1)t-=1.0/i;(2)return t;40.(1)fun(int a[][M], int m)(2)a[j][k]=(k+1)*(j+1);41.(1)sum=0;(2)scanf("%d",&a[i][j]);42.(1)while(*s)(2)s++;43.(1)r=t;(2)if(*r==0)44.(1)*t=0;(2)if(d%2!=0)45.(1)fun(int x,int y, int z)(2)return j;46.(1)int fun(int n,int xx[][M])(2)printf("%d",xx[i][j]);47.(1)p=s;(2)while(*p++);48.(1)float fun(int k)(2)return s;49.(1)int j, c=0; float xa=0.;(2)if (x[j]>=xa)50.(1)if(i%2 || s[i]%2==0)(2)t[j]=0;51.(1)double fun(double a,double x0)(2)if(fabs(x1-x0)>0.00001)52.(1)void fun (char *s, char *t)(2)t[2*d] = 0;53.(1)for(j=i+1;j<6;j++)(2)*(pstr+i)=*(pstr+j);54.(1)#define FU(m,n) ((m)/(n))(2)return (value);55.(1)while((fabs(t))>=num)(2)t=s/n;56.(1)fun (char *a)(2)printf("%c",*a);57.(1)double r;(2)while(fabs(m-n)>0.001)58.(1)void fun(long s,long *t)(2)while(s>0)59.(1)if (n==0)(2)result *= n-- ;60.(1)*t=0;(2)if(d%2!=0)61.(1)t=a;a=b;b=t;(2)return(b);62.(1)if(('a'<=tt[i])&&(tt[i]<='z'))(2)tt[i]-=32;63.(1)void fun(long s,long *t)(2)sl=sl*10;64.(1)float k;(2)if(*c>*a)65.(1)int k=0;(2)while( *p || *q )66.(1)double fun(int n)(2)s=s+(double)a/b;67.(1)t=*x;*x=y;(2)return t;68.(1)switch(g)(2)case 1: return 1; case 2:return 1;69.(1)int i,sl;(2)t[i]=s[sl-i-1];70.(1)while((2<=high) && (n<10))(2)yes=0; break;71.(1)fun (int n)(2)if(n==1) 72.(1)while(*w)(2)if(*r==*p)73.(1)for(i=0;str[i];i++)(2)if(substr[k+1]==0)74.(1)long s=0,t=0;(2)t=t/10;75.(1)a=0;(2)if(*r==*p)76.(1)s=s+(n+1.)/n;(2)return t;77.(1)a2=k/10;(2)return i;78.(1)char *fun( char (*sq)[M] )(2)return sp;79.(1)p=j;(2)p=i;80.(1)n=strlen( aa ) ;(2)ch=aa[i];81.(1)for(i=2;i<=m;i++)(2)y+=1.0/i/i;82.(1)if(p==n) return -1;(2)a[i]=a[i+1];83.(1)k++;(2)if(m==k)84.(1)b[k]=*p;(2)b[k]=' ';k++;85.(1)while(*r)(2)*a=*r;a++;r++;86.(1)for(i=0,t=0;p[i];i++)(2)c[t]=0;87.(1)long k=1;(2)num/=10;88.(1)for(i = 0 ; i < sl ; i++)(2)t[2*sl] = 0;89.(1)double f(double x)(2)return s;90.(1)fun(int a[],int m)(2)else if(m>a[mid])91.(1)double sum=0.;(2)sum /= c;92.(1)s[j++]=s[i];(2)s[j]=0;93.(1)t=1;(2)return(2*s);94.(1)if(d%2==0)(2)s/=10;95.(1n,int xx[][M])(2)printf("%d",xx[i][j]);96.(1)for(i=j+1;i<n;i++)(2)p=i;97.(1)q=p+i;(2)while(q>p)98.(1)n= *p-'0';(2)n=n*8+*p-'0';99.(1)sum=0;(2)if((i+1)%5==0)100.(1)fun(int x,int y, int z)(2)return j;三、编程题1.void fun(char *w, int m) {char a[N];int i;for(i=0;i<m;i++) a[i]=w[i]; while(w[i]) { w[i-m]=w[i]; i++;} i--;m--;for(;m>=0;m--,i--) w[i]=a[m]; } 2.int fun( STREC *a,STREC *b,int l, int h ) {int i,j=0;for(i=0;i<N;i++){if(a[i].s>=l && a[i].s<=h){b[j]=a[i];j++;}}return j;}3.fun( STU a[], STU *s ){int i;*s=a[0];for(i=1;i<N;i++){if(a[i].s<s->s){*s=a[i];}}}4.void fun( char *ss ){int i=1;while(ss[i-1] && ss[i]){if(ss[i]>='a' && ss[i]<='z') ss[i]+='A'-'a'; i+=2;}}5.float fun ( float h ){long i=h*1000;if(i%10<5) return (i/10)/100.0;else return (i/10+1)/100.0;}6.double fun ( double eps){double i=1,a=1,b=1,c=1,s=0;while(c>=eps) {s+=c;a*=i;b*=2*i+1;c=a/b;i++;}return s*2;}7.int fun(int score[], int m, int below[]) {int i,j=0,s=0;for(i=0;i<m;i++) s+=score[i];s/=m;for(i=0;i<m;i++){if(score[i]<s){below[j]=score[i];j++;}}return j;}8.void fun( char *a ){int i=0,j=0;while(a[i]){if(j==0 && a[i]!='*'){j=i+1;}else if(a[i]!='*'){a[j]=a[i];j++;}i++;}a[j]=0;}9.void fun( char *a ){int i=0,j=0;while(a[i]){if(a[i]!='*'){j=i;break;}i++;}while(a[i]){a[i-j]=a[i];i++;}i-=j;for(;j>0;j--){a[i]='*';i++;}}10.void fun( char *a, int n ) {int i=0,j=0;while(a[i]){if(a[i]!='*'){j=i;break;} i++;}if(j>n){while(a[i]){a[i-j+n]=a[i];i++;}a[i-j+n]=0;}}11.void fun ( int x, int pp[], int *n ) {int i;*n=0;for(i=1;i<=x;i+=2){if(x%i==0){pp[*n]=i;(*n)++;}}}12.void fun(char *s, char t[]) {int i=0,j=0;while(s[i]){if(i%2!=0 || s[i]%2==0){t[j]=s[i];j++;}i++;}t[j]=0;}13.void fun(int a, int b, long *c){*c=a/10*100+a%10+b/10*10+b%10*1000;}14.double fun( int n){int i;double s=0;for(i=1;i<n;i++){if(i%3==0 && i%7==0) s+=i;}return sqrt(s);}15.void fun(int (*s)[10], int *b, int *n, int mm, int nn){int i,j;*n=0;for(i=0;i<mm;i++)for(j=0;j<nn;j++){b[*n]=s[i][j];(*n)++;}}16.int fun( STREC a[] ){int i,j;STREC b;for(i=0;i<N-1;i++)for(j=i+1;j<N;j++)if(a[i].s<a[j].s){ b=a[i];a[i]=a[j];a[j]=b;}} 17.double fun ( int w[][N] ){double s=0;int i;for(i=0;i<N;i++)s+=w[0][i]+w[N-1][i]+w[i][0]+w[i][N-1];s-=w[0][0]+w[0][N-1]+w[N-1][0]+w[N-1][N-1]; return s/(N*4-4);}18.int fun(int *s, int t, int *k){int i;*k=0;for(i=0;i<t;i++)if(s[i]>s[*k]) *k=i;}19.void fun( char *a ){int i=0,j=0;while(a[i]){if(a[i]!='*') j=0;else j++;i++;}a[i-j]=0;}20.int fun(int lim, int aa[MAX]){int i,j,k=0;for(i=2;i<=lim;i++){for(j=2;j<i;j++)if(i%j==0) break;if(j==i){aa[k]=i;k++;}}return k;}21.void fun(int m, int k, int xx[]){int i,j=m+1,n=0;while(n<k){for(i=2;i<j;i++)if(j%i==0) break;if(j==i){xx[n]=i;n++;}j++;}}22.double fun( STREC *h ){double a=0;STREC *p=h->next;while(p){if(a<p->s) a=p->s;p=p->next;}return a;}23.double fun( STREC *a, STREC *b, int *n ) {int i;double s=0;for(i=0;i<N;i++)s+=a[i].s; s/=N;*n=0;for(i=0;i<N;i++)if(a[i].s>s){b[*n]=a[i];(*n)++;}return s;}24.int fun ( int a[M][N] ){int i,s=0;for(i=0;i<N;i++)s+=a[0][i]+a[M-1][i];for(i=1;i<M-1;i++)s+=a[i][0]+a[i][N-1];return s;}25.void fun(char *s, char t[]){int i=0,j=0;while(s[i]){if(i%2==1 && s[i]%2==1){t[j]=s[i];j++;}}t[j]=0;}26.fun(char(*a)[81],int num,char **max) {int i,j,k=strlen(a[0]);*max=a[0];for(i=1;i<num;i++){j=strlen(a[i]);if(k<j){k=j;*max=a[i];}}}27.int fun(char *str){int i,j=0;while(str[j]) j++;for(i=0;i<=j/2;i++)if(str[i]!=str[j-i-1]) break;if(i>=j/2) return 1;else return 0;}28.int fun(int a[], int n){int i,j=0;for(i=1;i<n;i++){if(a[i]!=a[j]){j++;a[j]=a[i];}}return j+1;}29.void fun(int a[], int n , int *max, int *d ) {int i;*d=0;for(i=1;i<n;i++)if(a[i]>a[*d]) *d=i; *max=a[*d];}30.int fun( char *s){int i=0,j=0,f=1;while(s[i]){if(s[i]<'a' || s[i]>'z'){if(f) j++;f=0;}elsef=1;i++;}return j+1;}31.int fun ( int a[][N], int m ){int i,j;for(i=0;i<N;i++)for(j=i;j<N;j++)a[i][j]*=m;}32.void fun(char (*s)[N], char *b) {int i,j,k=0;for(i=0;i<N;i++)for(j=0;j<M;j++){b[k]=s[j][i];k++;}}33.int fun( STREC *a, STREC *b ){int i,j=0,s=a[0].s;for(i=1;i<N;i++)if(a[i].s<s) s=a[i].s;for(i=0;i<N;i++)if(a[i].s==s){b[j]=a[i];j++;}return j;}34.double fun(double x , int n) {int i;double a=1,b=1,s=1;for(i=1;i<=n;i++){a*=x;b*=i;s+=a/b;}return s;}35.void fun(char *s, char t[]) {int i=0,j=0;while(s[i]){if(s[i]%2==0){t[j]=s[i];j++;}i++;}t[j]=0;} 36.fun (int a[][M]){int i,s=a[0][0];for(i=0;i<M;i++){if(a[0][i]>s) s=a[0][i];if(a[1][i]>s) s=a[1][i];}return s;}37.long fun ( char *p){long i,s=0;if(p[0]=='-'){i=1;while(p[i]){s=s*10+p[i]-'0';i++;}s*=-1;}else{i=0;while(p[i]){s=s*10+p[i]-'0';i++;}}return s;}38.void fun(int a, int b, long *c){*c=a/10*100+a%10+b/10*1000+b%10*10;}39.int fun(char *str){int i,k=0;char *p=str,s[81];while(*p){ if(*p!=' ') s[k++]=*p;p++;}for(i=0;i<k;i++) str[i]=s[i];str[i]='\0';}40.void fun(char p1[], char p2[]){char *p,*q;p=p1;q=p2;while(*p) p++;while(*q) *p++=*q++;*p='\0';}41.int fun(int array[3][3]){int i,j,t;for(i=0;i<3;i++)for(j=0;j<i;j++){ t=array[i][j];array[i][j]=array[j][i];array[j][i]=t;} }42.void fun(int *w, int p, int n){int i,a[N];for(i=0;i<=p;i++) a[i]=w[i];for(i=0;i<n-(p+1);i++) w[i]=w[i+(p+1)];for(i=0;i<=p;i++) w[n-(p+1)+i]=a[i];} 43.void fun(char a[M][N], char *b) {int i,k=0;char *p;for(i=0;i<M;i++){ p=a[i];while(*p) b[k++]=*p++;}b[k]='\0';}44.void fun(int a, int b, long *c){*c=a/10*10+a%10*1000+b/10+b%10*100; }45.void fun( char *a, int n,int h,int e ) {int i;for(i=0;i<n-h-e;i++){ a[i]=a[i+h];}a[i]=0;}46.void fun(int a, int b, long *c){*c=a/10*1000+a%10*10+b/10+b%10*100; }47.void fun( int *a, int *b){int i,k;for(i=0;i<M;i++) b[i]=0;for(i=0;i<N;i++){ k=a[i]/10;if(k>=10) b[10]++;else b[k]++;}}48.double fun( int n ){int i;double s;for(i=1;i<=n;i++){ s+=1.0/(i*(i+1));}return s;}49.float fun(int m, int n){ int i;float m1=1.0,n1=1.0,k=1.0;for(i=1;i<=m;i++) m1*=i;for(i=1;i<=n;i++) n1*=i;for(i=1;i<=m-n;i++) k*=i;return m1/n1/k;}50.void fun(int (*s)[10], int *b, int *n, int {int i,j,k=0;for(j=0;j<nn;j++)mm, int nn)for(i=0;i<mm;i++)b[k++]=s[i][j];*n=k;}51.double fun( STREC *a, STREC *b, int *n ){int i,j;double ave,sum=0.0;*n=0;for(i=0;i<N;i++){sum+=a[i].s;}ave=sum/N;for(i=0,j=0;i<N;){if(a[i].s>=ave){b[j]=a[i];j++;(*n)++;}i++;}return ave;}52.void fun(char *s, char t[]){int i=0,j=0;while(s[i]){if((i%2!=0)&&(s[i]%2!=0)){t[j]=s[i];j++;}i++;}t[j]=0;}53.int fun(char *ss, char c){int n=0,i=0;while(ss[i]){if(ss[i]==c){n++;}i++;}return n;}54..void fun( char *a ){int i=0,j=0;while(a[i]){if(a[i]!='*'){j=i;break;}i++;}while(a[i]){a[i-j]=a[i];i++;}a[i-j]='\0';}55.void fun (char a[], char b[], int n){int i=0,j=0;while(a[i]){if(i!=n){b[j]=a[i];j++;}i++;}b[j]='\0';}56.char *fun ( char *s, char *t){char *m,*n;m=s;n=t;while(*s&&*t){t++;s++;}if(*t)return n;else return m;}57.void fun( char *a, char *h,char *p ){int i=0;for(;a[i]=='*';i++)a[i]='*';while(h<p){ if(*h!='*'){a[i]=*h;i++; }h++;}while(*h){ a[i]=*h;i++;h++;}a[i]='\0';}58.void fun( STREC a[] ){int i,j;STREC b;for(i=0;i<N-1;i++)for(j=i+1;j<N;j++)if(a[i].s<a[j].s){ b=a[i];a[i]=a[j];a[j]=b;}}59.long fun ( char *p){long i,s=0;if(p[0]=='-'){i=1;while(p[i]){s=s*10+p[i]-'0';i++;}s*=-1;}else{i=0;while(p[i]){s=s*10+p[i]-'0';i++;}}return s;}60.void fun(char p1[], char p2[]){char *p,*q;p=p1;q=p2;while(*p) p++;while(*q) *p++=*q++;*p='\0';}61.void fun( char *a ){char p[81];int i=0,j=0;while(a[i]){if(a[i]!='*')a[j++]=a[i];i++;}a[j]=0;}62.void fun( int m, int *k, int xx[] ){int i,j,c=0;for(i=2;i<=m;i++){for(j=2;j<i;j++)if(i%j==0){xx[c]=i;c++;break;}}*k=c;}63.*c=a/10+a%10*100+b%10*10+b/10*1000;64.int fun( STREC *a, STREC *b ){int i,j=0,s=a[0].s;for(i=1;i<N;i++)if(a[i].s>s) s=a[i].s;for(i=0;i<N;i++)if(a[i].s==s){b[j]=a[i];j++;}return j;}65.void fun( char *a ){int i=0,j=0;while(a[i]){if(j==0 && a[i]!='*'){j=i+1;}else if(a[i]!='*'){a[j]=a[i];j++;}i++;}a[j]=0;}66.int fun (int a[][M]){int i,j,max=0;for(i=0;i<2;i++)for(j=0;j<M;j++){if(max<a[i][j])max=a[i][j];}return max;}67.void fun (int *a, int *n){int i=0,j=0;*n=0;for(;i<=1000;i++){if(i%7==0||i%11==0){if(i%7==0&&i%11==0)continue;(*n)++;a[j++]=i;}}return *n;}68.void fun(STREC *a){int i=0;double sum=0.0;for(;i<N;i++){sum+=a->s[i];}a->ave=sum/N;}69.void fun(int a, int b, long *c){*c=a/10*100+a%10+b/10*1000+b%10*10;}70.double fun(){float x0,x1=0.0;while(1){x0=x1;x1=cos(x0);if(fabs(x0-x1)<1e-6) break;}return x1;}71.void fun( char *a,int n ){int i=0,j=0,c,k;while(a[i])i++;c=i;while(a[i-1]=='*'){j++;i--;}if(j>n){k=j-n;a[c-k]='\0';}}72.void fun(char *s, char t[]){int i=0,j=0,m;while(m=s[i]){if(m%2==0){t[j]=s[i];j++;}i++;}t[j]='\0';}73.double fun ( double eps){int i=0;double pi=0,a=1;while(a>=eps){pi+=a;i++;a=a*i/(2*i+1);}return pi*2;}74.void fun(char *tt, int pp[]){int i;for(i=0;i<26;i++)pp[i]=0;i=0;while(tt[i]){pp[tt[i]-97]++;i++;}}75.void fun(char *s, char t[]){int i=0,k=0,length;length=strlen(s);while(i<length){if(i%2==0 && s[i]%2==0){t[k]=s[i];k++;i++;}elsei++;}t[k]='\0';}76.int fun( int t){int a=1,b=1,c=0,i;for(i=4;i<=t;i++){if(c<t){c=a+b;a=b;b=c;}elsebreak;}return c;}77.void fun( char *a ){while(*a!=NULL)a++;a--;while(*a=='*')a--;a++;*a='\0';}78.void fun(int a, int b, long *c){*c=a/10*100+a%10+b/10*10+b%10*1000;}79.void fun ( int m, int *a , int *n ){int i,j;*n=0;for(i=1,j=0;i<=m;i++){if((i%7==0)||(i%11==0)){a[j]=i;j++;(*n)++;}}}80.double fun( STREC *h ){double max;STREC *p;p=h->next;max=p->s;while(p){if(p->s>max){max=p->s;}p=p->next;}return max;}81. void fun ( int a[3][3], int b[3][3]){int i,j;for(i=0;i<3;i++)for(j=0;j<3;j++)b[i][j]=0;for(i=0;i<3;i++)for(j=0;j<3;j++)b[i][j]=a[i][j]+a[j][i];}82. int fun( STREC *a, STREC *b ){int i,j=0,score;score=a[0].s;for(i=0;i<N;i++)if(score>a[i].s)score=a[i].s;for(i=0;i<N;i++)if(score==a[i].s){strcpy(b[j].num,a[i].num);b[j].s=a[i].s; j++;}return j;}83.void fun(int a[], int n , int *max, int *d ){int i,j,k=0;i=a[0];for(j=0;j<n;j++)if(i<a[j]){i=a[j];k=j;}*max=i;*d=k;}84.double fun( STREC *h ){float ave,sum=0.0;STREC *p;p=h->next;while(p){sum+=p->s;p=p->next;}ave=sum/N;return ave;}85.void fun(char *s, char t[]){int i;for(i=0;i<50;i++)t[i]=s[2*i+1];}86.void fun ( char *ss ){int i=0;while (ss[i]){if(i%2!=0){if(ss[i]>='a'&&ss[i]<='z'){ss[i]-=32;}}i++;}}87.float fun ( float *a , int n ){int i;double sum=0.0,ave;for(i=0;i<n;i++)sum+=a[i];ave=sum/n;return ave;}88.void fun(int a, int b, long *c){*c=a/10*1000+a%10*10+b/10*100+b%10;}89.double fun( int m ){int i=1;double sum=0.0;for(;i<=20;i++){sum = sum + log(i);}sum=sqrt(sum);return sum;}90.void fun(char *a,char *p){ char *q;while(a<p)if(*a=='*'){ for(q=a;*q;q++)*q=*(q+1);p--;}else a++;}91.double func(int n){int i, j;float sum, resu;resu = 0;for (i = 1; i <= n; i++){sum = 0;for (j = 1; j <= i; j++){sum = sum + j;}resu = resu + 1 / sum;}return resu;}92.void func(char *a){char *p, *q;int n = 0;p = a;while (*p == '*'){n++;p++;}q = a;while (*p != NULL){*q = *p;p++;q++;}for (; n > 0; n--){*q++ = '*';}*q = '\0';} 93.void func( char *a, int n){int i=0,j=0;while(a[i]){if(a[i]!='*'){j=i;break;}i++;}if(j>n){while(a[i]){a[i-j+n]=a[i];i++;}a[i-j+n]=0;}}94.void fun(int a, int b, long *c){*c=a/10*10+a%10*1000+b/10*100+b%10;}95.void fun(int a, int b, long *c){*c=a/10*1000+a%10*10+b/10+b%10*100;}96.void fun(int a, int b, long *c){*c=a/10+a%10*100+b/10*10+b%10*1000;}97.int fun( STREC *a,STREC *b,int l, int h ){int i,j=0;for(i=0;i<N;i++){if(a[i].s>=l&&a[i].s<=h){b[j]=a[i];j++;}}return j;}98.STREC fun( STREC *a, char *b ){STREC res;int i;for(i=0;i<N;i++){if(strcmp(a[i].num,b)==0) {res=a[i];return res;}}strcpy(res.num,"");res.s=-1;return res;} 99.double fun( STREC *a, STREC *b, int *n ){int i,j;double ave,sum=0.0;*n=0;for(i=0;i<N;i++){sum+=a[i].s;}ave=sum/N;for(i=0,j=0;i<N;){if(a[i].s<=ave){b[j]=a[i];j++;(*n)++;}i++;}return ave;}100.void fun( char *a, int n,int h,int e ){int i;for(i=0;i<n-h-e;i++)a[i]=a[i+h];a[i]='\0';}。